Advertisement

Hitting Set Problem for Axis-Parallel Squares Intersecting a Straight Line Is Polynomially Solvable for Any Fixed Range of Square Sizes

  • Daniel KhachayEmail author
  • Michael Khachay
  • Maria Poberiy
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10716)

Abstract

The Hitting Set Problem is the well known discrete optimization problem adopting interest of numerous scholars in graph theory, computational geometry, operations research, and machine learning. The problem is NP-hard and remains intractable even in very specific settings, e.g., for axis-parallel rectangles on the plane. Recently, for unit squares intersecting a straight line, a polynomial time optimal algorithm was proposed. Unfortunately, the time consumption of this algorithm was \(O(n^{145})\). We propose an improved algorithm, whose complexity bound is more than 100 orders of magnitude less. We extend this algorithm to the more general case of the problem and show that the geometric HSP for axis-parallel (not necessarily unit) squares intersected by a line is polynomially solvable for any fixed range of squares to hit. We believe that the obtained theoretical complexity bounds for our algorithms still can be improved further. According to the results of the numerical evaluation presented in the concluding section of the paper, at least for unit squares, an average time consumption bound of our algorithm is less then its deterministic counterpart by 9 orders of magnitude.

Keywords

Hitting Set Problem Dynamic programming Computational geometry Parameterized complexity 

Notes

Acknowledgements

This research was supported by Russian Foundation for Basic Research, grants no. 16-07-00266 and 17-08-01385, and Complex Program of Ural Branch of RAS, grant no. 15-7-1-23.

References

  1. 1.
    Brönnimann, H., Goodrich, M.T.: Almost optimal set covers in finite VC-dimension. Discrete Comput. Geom. 14(4), 463–479 (1995)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Chan, T.M.: Polynomial-time approximation schemes for packing and piercing fat objects. J. Algorithms 46(2), 178–189 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Chepoi, V., Felsner, S.: Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve. Comput. Geom. 46(9), 1036–1041 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Correa, J., Feuilloley, L., Pérez-Lantero, P., Soto, J.A.: Independent and hitting sets of rectangles intersecting a diagonal line: algorithms and complexity. Discrete Comput. Geom. 53(2), 344–365 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Fowler, R.J., Paterson, M.S., Tanimoto, S.L.: Optimal packing and covering in the plane are NP-complete. Inf. Process. Lett. 12(3), 133–137 (1981)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Haussler, D., Welzl, E.: Epsilon-nets and simplex range queries. Discrete Comput. Geom. 2(2), 127–151 (1987)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Hochbaum, D., 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.
    Khachay, M.: Committee polyhedral separability: complexity and polynomial approximation. Mach. Learn. 101(1), 231–251 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Khachay, M., Poberii, M.: Complexity and approximability of committee polyhedral separability of sets in general position. Informatica 20(2), 217–234 (2009)MathSciNetzbMATHGoogle Scholar
  10. 10.
    Khachay, M., Pobery, M., Khachay, D.: Integer partition problem: theoretical approach to improving accuracy of classifier ensembles. Int. J. Artif. Intell. 13(1), 135–146 (2015)Google Scholar
  11. 11.
    Khachay, M., Khachay, D.: On parameterized complexity of the Hitting Set Problem for axis-parallel squares intersecting a straight line. Ural Math. J. 2, 117–126 (2016)CrossRefGoogle Scholar
  12. 12.
    Matoušek, J.: Lectures on Discrete Geometry. Springer, New York (2002).  https://doi.org/10.1007/978-1-4613-0039-7 CrossRefzbMATHGoogle Scholar
  13. 13.
    Mudgal, A., Pandit, S.: Covering, hitting, piercing and packing rectangles intersecting an inclined line. In: Lu, Z., Kim, D., Wu, W., Li, W., Du, D.-Z. (eds.) COCOA 2015. LNCS, vol. 9486, pp. 126–137. Springer, Cham (2015).  https://doi.org/10.1007/978-3-319-26626-8_10 CrossRefGoogle Scholar
  14. 14.
    Mustafa, N.H., Varadarajan, K.: Epsilon-approximations and epsilon-nets. CoRR, abs/1702.03676 (2017)Google Scholar
  15. 15.
    Ramakrishnan, S., El Emary, I.M.M.: Wireless Sensor Networks: From Theory to Applications. Taylor & Francis, CRC Press, New York (2014)Google Scholar
  16. 16.
    Schapire, R., Freund, Y.: Boosting: Foundations and Algorithms. MIT Press, Cambridge (2012)zbMATHGoogle Scholar
  17. 17.
    Vapnik, V., Chervonenkis, A.: On the uniform convergence of relative frequencies of events to their probabilities. Theory Probab. Appl. 16, 264–280 (1971)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  • Daniel Khachay
    • 1
    • 2
    Email author
  • Michael Khachay
    • 1
    • 2
    • 3
  • Maria Poberiy
    • 1
  1. 1.Krasovsky Institute of Mathematics and MechanicsEkaterinburgRussia
  2. 2.Ural Federal UniversityEkaterinburgRussia
  3. 3.Omsk State Technical UniversityOmskRussia

Personalised recommendations