Lower Bounds for Covering Problems

In this paper we present an Ω(nlog n) lower bound proof for several covering problems including the optimal line bipartition problem, min-max covering by two axis parallel rectangles, discrete and continuous two-center problems, two-line center problem, etc. Our proofs are based on using the ‘rotational reduce technique’ and well-known lower bound for the maximal gap problem.

[1]  Joseph S. B. Mitchell,et al.  Finding Optimal Bipartitions of Points and Polygons , 1991, WADS.

[2]  Micha Sharir,et al.  An Expander-Based Approach to Geometric Optimization , 1997, SIAM J. Comput..

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

[4]  Micha Sharir,et al.  Planar geometric location problems and maintaining the width of a planar set , 1991, SODA '91.

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

[6]  Jerzy W. Jaromczyk,et al.  A Note on Lower Bounds for the Maximum Area and Maximum Perimeter (kappa)k-gon Problems , 1989, Inf. Process. Lett..

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

[8]  Jerzy W. Jaromczyk,et al.  The Two-Line Center Problem from a Polar View: A New Algorithm and Data Structure , 1995, WADS.

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

[10]  Tetsuo Asano,et al.  Clustering algorithms based on minimum and maximum spanning trees , 1988, SCG '88.

[11]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[12]  Micha Sharir,et al.  Rectilinear and polygonal p-piercing and p-center problems , 1996, SCG '96.

[13]  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).

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

[15]  Klara Kedem,et al.  On some geometric selection and optimization problems via sorted matrices , 1998, Comput. Geom..

[16]  David Avis,et al.  Lower Bounds for Line Stabbing , 1989, Inf. Process. Lett..

[17]  N. Megiddo.  Linear-time algorithms for linear programming in R3 and related problems , 1982, FOCS 1982.

[18]  Michael Segal,et al.  Constrained Square-Center Problems , 1998, SWAT.

[19]  Matthew J. Katz,et al.  Optimal Line Bipartitions of Point Sets , 1999, Int. J. Comput. Geom. Appl..

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