JAIST Repository >
School of Information Science >
Articles >
Journal Articles >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10119/9186

Title: Constructing Optimal Highways
Authors: Ahn, Hee-Kap
Alt, Helmut
Asano, Tetsuo
Bae, Sang Won
Brass, Peter
Cheong, Otfried
Knauer, Christian
Na, Hyeon-Suk
Shin, Chan-Su
Wolff, Alexander
Keywords: geometric facility location
min-max-min problem
city metric
time metric
optimal highways
Issue Date: 2009
Publisher: World Scientific Publishing
Magazine name: International Journal of Foundations of Computer Science
Volume: 20
Number: 1
Start page: 3
End page: 23
DOI: 10.1142/S0129054109006425
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 h and 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.
Rights: Electronic version of an article published as International Journal of Foundations of Computer Science, 20(1), 2009, 3-23. DOI:10.1142/S0129054109006425. Copyright World Scientific Publishing Company, http://dx.doi.org/10.1142/S0129054109006425
URI: http://hdl.handle.net/10119/9186
Material Type: author
Appears in Collections:b10-1. 雑誌掲載論文 (Journal Articles)

Files in This Item:

File Description SizeFormat
14487.pdf214KbAdobe PDFView/Open

All items in DSpace are protected by copyright, with all rights reserved.


Contact : Library Information Section, Japan Advanced Institute of Science and Technology