Covering Segments with Unit Squares

  • Ankush Acharyya
  • Subhas C. Nandy
  • Supantha Pandit
  • Sasanka Roy
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10389)


We study several variations of line segment covering problem with axis-parallel unit squares in the plane. Given a set S of n line segments, the objective is to find the minimum number of axis-parallel unit squares which cover at least one end-point of each segment. The variations depend on the orientation and length of the input segments. We prove some of these problems to be NP-complete, and give constant factor approximation algorithms for those problems. For the general version of the problem, where the segments are of arbitrary length and orientation, and the squares are given as input, we propose a factor 16 approximation result based on multilevel linear programming relaxation technique. This technique may be of independent interest for solving some other problems. We also show that our problems have connections with the problems studied by Arkin et al. [2] on conflict-free covering problem. Our NP-completeness results hold for more simplified types of objects than those of Arkin et al. [2].


Segment cover Unit square NP-hardness Linear programming Approximation algorithms PTAS 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Arkin, E.M., Banik, A., Carmi, P., Citovsky, G., Katz, M.J., Mitchell, J.S.B., Simakov, M.: Choice is hard. In: Elbassioni, K., Makino, K. (eds.) ISAAC 2015. LNCS, vol. 9472, pp. 318–328. Springer, Heidelberg (2015). doi: 10.1007/978-3-662-48971-0_28 CrossRefGoogle Scholar
  2. 2.
    Arkin, E.M., Banik, A., Carmi, P., Citovsky, G., Katz, M.J., Mitchell, J.S.B., Simakov, M.: Conflict-free covering. In: CCCG (2015)Google Scholar
  3. 3.
    Bansal, N., Pruhs, K.: The geometry of scheduling. SIAM J. Comput. 43(5), 1684–1698 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Biniaz, A., Liu, P., Maheshwari, A., Smid, M.: Approximation algorithms for the unit disk cover problem in 2D and 3D. Computational Geometry 60, 8–18 (2016)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Chan, T.M., Grant, E., Konemann, J., Sharpe, M.: Weighted capacited, priority, and geometric set cover via improved quasi-uniform sampling. In: SODA, pp. 1576–1585 (2012)Google Scholar
  6. 6.
    Gaur, D.R., Ibaraki, T., Krishnamurti, R.: Constant ratio approximation algorithms for the rectangle stabbing problem and the rectilinear partitioning problem. Journal of Algorithms 43(1), 138–152 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Hochbaum, D.S., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM 32(1), 130–136 (1985)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Knuth, D.E., Raghunathan, A.: The problem of compatible representatives. SIAM Journal on Discrete Mathematics 5(3), 422–427 (1992)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Kobylkin, K.: Computational complexity of guarding of proximity graphs. CoRR, abs/1605.00313, 2016Google Scholar
  10. 10.
    Madireddy, R.R., Mudgal, A.: Stabbing line segments with disks and related problems. In: CCCG (2016)Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Ankush Acharyya
    • 1
  • Subhas C. Nandy
    • 1
  • Supantha Pandit
    • 1
  • Sasanka Roy
    • 1
  1. 1.Indian Statistical InstituteKolkataIndia

Personalised recommendations