Given two sets of points in the plane, we are interested in locating a highway h such that an objective function on the city distance between points of the two sets is minimized (where the city distance is measured with speed v > 1 on a highway and 1 in the underlying metric elsewhere). Extending the results of Ahn et al. ([7]), we consider the option that there are already some built highways. We give a unified approach to this problem to design polynomial-time algorithms for several combinations of objective functions and types of the inserted highway (turnpike or freeway). © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Korman, M., & Tokuyama, T. (2008). Optimal insertion of a segment highway in a city metric. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5092 LNCS, pp. 611–620). https://doi.org/10.1007/978-3-540-69733-6_60
Mendeley helps you to discover research relevant for your work.