Abstract
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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Avis D., Robert, J. and Wenger, R.: Lower bounds for line stabbing, Inf. Process. Lett. 33 (1990), 59–62.
Agarwal, P. K. and Sharir, M.: Planar geometric location problem and maintaining the width of a planar set, In: Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms, 1991, pp. 449–458.
Asano, T., Bhattacharya, B., Keil, J. and Yao, F.: Clustering algorithms based on minimum and maximum spanning trees, In: Proc. 4th Ann. ASM Sympos. Comput. Geom.1988, pp. 252–257.
Bespamyatnikh, S. and Segal, M.: Rectilinear static and dynamic discrete 2-center problems, In: Workshop on Algorithms and Data Structures (WADS'99), Lecture Notes in Comput. Sci. 1663, Springer-Verlag, New York, pp. 276–287.
Devillers, O. and Katz, M.: Optimal line bipartitions of point sets, Int. J. Comput. Geom. Appl. 9 (1999), 39–52.
Drysdale, R., III and Jaromczyk, J.: A note on lower bounds for the maximum area and maximum perimeter k-gon problems, Inf. Process. Lett. 32 (1989), 301–303.
Eppstein, D.: Faster construction of planar two-centers, In: Proc. 8th ACM-SIAM Sympos. Discrete Algorithms, 1997, pp. 131–138.
Glozman, A., Kedem, K. and Shpitalnik, G.: On some geometric selection and optimization problems via sorted matrices, Comput. Geom. 11 (1998), 17–28.
Hershberger, J. and Suri, S.: Finding tailored partitions, J. Algorithms 12 (1991), 431–463.
Jaromczyk, J. and Kowaluk, M.: Orientation independent covering of point sets in R 2 with pairs of rectangles or optimal squares, In: European Workshop of Comput. Geom., University of Muenster, 1996, pp. 54–61.
Jaromczyk, J. and Kowaluk, M.: An efficient algorithm for the Euclidean two-center problem, In: Proc. 10th ACM Sympos. Comput. Geom., 1994, pp. 303–311.
Jaromczyk, J. and Kowaluk, M.: The two-line center problem from a polar view: A new algorithm and data structure, In: Lecture Notes in Comput. Sci. 995, Springer-Verlag, New York, 1995, pp. 13–25.
Katz, M., Kedem, K. and Segal, M.: Constrained square-center problems, In: Lecture Notes in Comput. Sci. 1432, Springer-Verlag, New York, 1998, pp. 95–106.
Katz, M. and Sharir, M.: An expander-based approach to geometric optimization, SIAM J. Comput. 26 (1997), 1384–1408.
Lee, D. T. and Wu, Y. F.: Geometric complexity of some location problems, Algorithmica 1 (1986), 193–211.
Megiddo, N.: Linear time algorithms for linear programming in R 3 and related problems, SIAM J. Comput. 13 (1984), 759–776.
Mitchell, J. and Wynters, E.: Finding optimal bipartitions of points and polygons, In: Proc. 2nd Workshop of Algorithms and Data Structures, Lecture Notes in Comput. Sci. 519, Springer-Verlag, New York, 1991, pp. 202–213.
Preparata, F. and Shamos, M.: Computational Geometry: An Introduction, Springer-Verlag, New York, 1985.
Sharir, M.: A near-linear algorithm for the planar 2-center problem, Discrete Comput. Geom. 18 (1997), 125–134.
Sharir, M. and Welzl, E.: Rectilinear and polygonal p-piercing and p-center problems, In: Proc. 12th ACM Sympos. Comput. Geom., 1996, pp. 122–132.
Woeginger, G.: A comment on a minmax location problem, Oper. Res. Lett. 23 (1998), 41–43.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Segal, M. Lower Bounds for Covering Problems. Journal of Mathematical Modelling and Algorithms 1, 17–29 (2002). https://doi.org/10.1023/A:1015670603203
Issue Date:
DOI: https://doi.org/10.1023/A:1015670603203