The 1-Center and 1-Highway Problem

In this paper we extend the Rectilinear 1-center as follows: Given a set S of n points in the plane, we are interested in locating a facility point f and a rapid transit line (highway) H that together minimize the expression max p ∈ Sd H (p,f), where d H (p,f) is the travel time between p and f. A point p ∈ S uses H to reach f if H saves time for p. We solve the problem in O(n2) or O(nlogn) time, depending on whether or not the highway’s length is fixed.

[1]  Sergey Bereg,et al.  Rectilinear 2-center problems , 1999, CCCG.

[2]  Zvi Drezner,et al.  Facility location - applications and theory , 2001 .

[3]  Chandrajit L. Bajaj,et al.  Proving Geometric Algorithm Non-Solvability: An Application of Factoring Polynomials , 1986, J. Symb. Comput..

[4]  Sergey Bereg,et al.  Rectilinear Static and Dynamic Discrete 2-center Problems , 1999, WADS.

[5]  Sang Won Bae,et al.  All Farthest Neighbors in the Presence of Highways and Obstacles , 2009, WALCOM.

[6]  Antonio M. Rodríguez-Chía,et al.  Simultaneous location of a service facility and a rapid transit line , 2011, Comput. Oper. Res..

[7]  D. T. Lee,et al.  Geometric complexity of some location problems , 1986, Algorithmica.

[8]  Matias Korman Theory and applications of geometric optimization problems in rectilinear metric spaces , 2009 .

[9]  Jean Cardinal,et al.  Optimal location of transportation devices , 2008, Comput. Geom..

[10]  Franz Aurenhammer,et al.  Quickest Paths, Straight Skeletons, and the City Voronoi Diagram , 2002, SCG '02.

[11]  David Eppstein,et al.  Faster construction of planar two-centers , 1997, SODA '97.

[12]  Yin-Te Tsai,et al.  A fast algorithm for the alpha-connected two-center decision problem , 2003, Inf. Process. Lett..

[13]  Tomás Feder,et al.  Optimal algorithms for approximate clustering , 1988, STOC '88.

[14]  Jean Cardinal,et al.  Highway hull revisited , 2008, Comput. Geom..

[15]  E. Carrizosa,et al.  Weber problems with alternative transportation systems , 1997 .

[16]  Gerhard J. Woeginger A comment on a minmax location problem , 1998, Oper. Res. Lett..

[17]  Z. Drezner On the rectangular p‐center problem , 1987 .

[18]  Rolf Klein,et al.  Voronoi Diagram for services neighboring a highway , 2003, Inf. Process. Lett..

[19]  José Miguel Díaz-Báñez,et al.  Continuous location of dimensional structures , 2004, Eur. J. Oper. Res..

[20]  Alexander Wolff,et al.  Constructing Optimal Highways , 2007, CATS.

[21]  Frank Plastria,et al.  Continuous Location Problems , 1995 .

[22]  Matias Korman,et al.  Locating a Service Facility and a Rapid Transit Line , 2011, EGC.

[23]  Matias Korman,et al.  Optimal Insertion of a Segment Highway in a City Metric , 2008, COCOON.

[24]  Said Salhi,et al.  Facility Location: A Survey of Applications and Methods , 1996 .

[25]  Gilbert Laporte,et al.  Optimization methods for the planning of rapid transit systems , 2000, Eur. J. Oper. Res..

[26]  Rajan Batta,et al.  Mixed planar/network facility location problems , 1988, Comput. Oper. Res..

[27]  Godfried T. Toussaint,et al.  Computational geometry and facility location , 1990 .