DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ahn, HK | ko |
dc.contributor.author | Alt, H | ko |
dc.contributor.author | Asano, T | ko |
dc.contributor.author | Bae, SW | ko |
dc.contributor.author | Brass, P | ko |
dc.contributor.author | Cheong, Otfried | ko |
dc.contributor.author | Knauer, C | ko |
dc.contributor.author | Na, HS | ko |
dc.contributor.author | Shin, CS | ko |
dc.contributor.author | Wolff, A | ko |
dc.contributor.author | Alt, H | ko |
dc.contributor.author | Bae, SW | ko |
dc.contributor.author | Brass, P | ko |
dc.contributor.author | Knauer, C | ko |
dc.contributor.author | Na, HS | ko |
dc.contributor.author | Shin, CS | ko |
dc.date.accessioned | 2010-02-25T02:44:23Z | - |
dc.date.available | 2010-02-25T02:44:23Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2009-02 | - |
dc.identifier.citation | INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, v.20, no.1, pp.3 - 23 | - |
dc.identifier.issn | 0129-0541 | - |
dc.identifier.uri | http://hdl.handle.net/10203/16800 | - |
dc.description.abstract | For two points p and q in the plane, a straight line h, called a highway, and a real v > 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 v on hand with speed 1 in the underlying metric elsewhere . Given a set S of n points in the plane and a highway speed v, we consider the problem of finding a highway that minimizes the maximum travel time over all pairs of points in S. If the orientation of the highway is fixed the optimal highway can be computed in linear time both for the L(1)- and the Euclidean metric as the underlying metric. If arbitrary orientations are allowed, then the optimal highway can be computed in O(n(2) log n) time. We also consider the problem of computing an optimal pair of highways, one being horizontal, one vertical. | - |
dc.language | English | - |
dc.language.iso | en_US | en |
dc.publisher | WORLD SCIENTIFIC PUBL CO PTE LTD | - |
dc.subject | CITY VORONOI DIAGRAM | - |
dc.subject | DISTANCES | - |
dc.subject | PATHS | - |
dc.title | CONSTRUCTING OPTIMAL HIGHWAYS | - |
dc.type | Article | - |
dc.identifier.wosid | 000263627000002 | - |
dc.identifier.scopusid | 2-s2.0-65249091349 | - |
dc.type.rims | ART | - |
dc.citation.volume | 20 | - |
dc.citation.issue | 1 | - |
dc.citation.beginningpage | 3 | - |
dc.citation.endingpage | 23 | - |
dc.citation.publicationname | INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE | - |
dc.embargo.liftdate | 9999-12-31 | - |
dc.embargo.terms | 9999-12-31 | - |
dc.contributor.localauthor | Cheong, Otfried | - |
dc.contributor.nonIdAuthor | Ahn, HK | - |
dc.contributor.nonIdAuthor | Alt, H | - |
dc.contributor.nonIdAuthor | Asano, T | - |
dc.contributor.nonIdAuthor | Bae, SW | - |
dc.contributor.nonIdAuthor | Brass, P | - |
dc.contributor.nonIdAuthor | Knauer, C | - |
dc.contributor.nonIdAuthor | Na, HS | - |
dc.contributor.nonIdAuthor | Shin, CS | - |
dc.contributor.nonIdAuthor | Wolff, A | - |
dc.contributor.nonIdAuthor | Alt, H | - |
dc.contributor.nonIdAuthor | Bae, SW | - |
dc.contributor.nonIdAuthor | Brass, P | - |
dc.contributor.nonIdAuthor | Knauer, C | - |
dc.contributor.nonIdAuthor | Na, HS | - |
dc.contributor.nonIdAuthor | Shin, CS | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | Geometric facility location | - |
dc.subject.keywordAuthor | min-max-min problem | - |
dc.subject.keywordAuthor | city metric | - |
dc.subject.keywordAuthor | time metric | - |
dc.subject.keywordAuthor | optimal highways | - |
dc.subject.keywordPlus | CITY VORONOI DIAGRAM | - |
dc.subject.keywordPlus | DISTANCES | - |
dc.subject.keywordPlus | PATHS | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.