Optimal Insertion of a Segment Highway in a City Metric

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). Key words: facility location, city metric, computational geometry, optimization problems, algorithms, urban planning

• Type: Conference
• Year: 2008
• Where: COCOON
• Authors: Matias Korman, Takeshi Tokuyama
• Keywords: Ahn Et Al, City Distance, COCOON 2008, Combinatorics, Objective Functions