The mixed center location problem

This paper studies a new version of the location problem called the mixed center location problem. Let P be a set of n points in the plane. We first consider the mixed 2-center problem where one of the centers must be in P and solve it in \(O(n^2\log n)\) time. Next we consider the mixed k-center problem where m of the centers are in P. Motivated by two practical constraints, we propose two variations of the problem. We present an exact algorithm, a 2-approximation algorithm and a heuristic algorithm solving the mixed k-center problem. The time complexity of the exact algorithm is \(O(n^{m+O(\sqrt{k-m})})\).

[1]  Jerzy W. Jaromczyk,et al.  An efficient algorithm for the Euclidean two-center problem , 1994, SCG '94.

[2]  Timothy M. Chan.  More planar two-center algorithms , 1999, Comput. Geom..

[3]  Subhash Suri,et al.  Finding Tailored Partitions , 1991, J. Algorithms.

[4]  John Hershberger.  A Faster Algorithm for the Two-Center Decision Problem , 1993, Inf. Process. Lett..

[5]  David B. Shmoys,et al.  A Best Possible Heuristic for the k-Center Problem , 1985, Math. Oper. Res..

[6]  Baruch Schieber,et al.  The Euclidean k-Supplier Problem , 2013, IPCO.

[7]  Franz Aurenhammer,et al.  Voronoi Diagrams and Delaunay Triangulations , 2013 .

[8]  Teofilo F. GONZALEZ,et al.  Clustering to Minimize the Maximum Intercluster Distance , 1985, Theor. Comput. Sci..

[9]  Micha Sharir.  A Near-Linear Algorithm for the Planar 2-Center Problem , 1997, Discret. Comput. Geom..

[10]  Zvi Drezner,et al.  The p-Centre Problem—Heuristic and Optimal Algorithms , 1984 .

[11]  Richard C. T. Lee,et al.  The slab dividing approach to solve the EuclideanP-Center problem , 2005, Algorithmica.

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

[13]  Nimrod Megiddo,et al.  On the Complexity of Some Common Geometric Location Problems , 1984, SIAM J. Comput..

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

[15]  Micha Sharir,et al.  The Discrete 2-Center Problem , 1998, Discret. Comput. Geom..

[16]  Nimrod Megiddo,et al.  Linear-time algorithms for linear programming in R3 and related problems , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).