Constructing Optimal Highways
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ahn, H.K. | - |
dc.contributor.author | Alt, H. | - |
dc.contributor.author | Asano, T. | - |
dc.contributor.author | Bae, S.W. | - |
dc.contributor.author | Brass, P. | - |
dc.contributor.author | Cheong, O. | - |
dc.contributor.author | Knauer, C. | - |
dc.contributor.author | Na, H.S. | - |
dc.contributor.author | Shin, C.S. | - |
dc.contributor.author | Wolff, A. | - |
dc.date.available | 2019-04-10T11:20:55Z | - |
dc.date.created | 2018-04-17 | - |
dc.date.issued | 2007-02 | - |
dc.identifier.isbn | 1920682465 | - |
dc.identifier.issn | 1445-1336 | - |
dc.identifier.uri | http://scholarworks.bwise.kr/ssu/handle/2018.sw.ssu/33682 | - |
dc.description.abstract | For two points p and q in the plane, a (unbounded) line h, called a highway, and a real ν > 1, we define the travel time (also known as the city distance) from p and q to be the time needed to traverse a quickest path from p to q, where the distance is measured with speed ν on h and with speed 1 in the underlying metric elsewhere. Given a set S of n points in the plane and a highway speed ν, we consider the problem of finding an axis-parallel line, the highway, that minimizes the maximum travel time over all pairs of points in S. We achieve a linear-time algorithm both for the L1- and the Euclidean metric as the underlying metric. We also consider the problem of computing an optimal pair of highways, one being horizontal, one vertical. © 2007, Australian Computer Society, Inc. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | Australian Computer Society | - |
dc.relation.isPartOf | Conferences in Research and Practice in Information Technology Series | - |
dc.title | Constructing Optimal Highways | - |
dc.type | Conference | - |
dc.type.rims | CONF | - |
dc.identifier.bibliographicCitation | Theory of Computing 2007 - 13th Computing: The Australasian Theory Symposium, CATS 2007, v.65 | - |
dc.description.journalClass | 2 | - |
dc.identifier.scopusid | 2-s2.0-84863599866 | - |
dc.citation.conferenceDate | 2007-01-30 | - |
dc.citation.conferencePlace | AT | - |
dc.citation.conferencePlace | Ballarat, VIC | - |
dc.citation.title | Theory of Computing 2007 - 13th Computing: The Australasian Theory Symposium, CATS 2007 | - |
dc.citation.volume | 65 | - |
dc.contributor.affiliatedAuthor | Na, H.S. | - |
dc.type.docType | Conference Paper | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Soongsil University Library 369 Sangdo-Ro, Dongjak-Gu, Seoul, Korea (06978)02-820-0733
COPYRIGHT ⓒ SOONGSIL UNIVERSITY, ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.