TY - GEN
T1 - Optimal insertion of a segment highway in a city metric
AU - Korman, Matias
AU - Tokuyama, Takeshi
PY - 2008/8/4
Y1 - 2008/8/4
N2 - 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).
AB - 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).
UR - http://www.scopus.com/inward/record.url?scp=48249106989&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=48249106989&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-69733-6_60
DO - 10.1007/978-3-540-69733-6_60
M3 - Conference contribution
AN - SCOPUS:48249106989
SN - 3540697322
SN - 9783540697329
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 611
EP - 620
BT - Computing and Combinatorics - 14th Annual International Conference, COCOON 2008, Proceedings
T2 - 14th Annual International Conference on Computing and Combinatorics, COCOON 2008
Y2 - 27 June 2008 through 29 June 2008
ER -