Approximation Algorithms for Hitting Triangle-Free Sets of Line Segments
We present polynomial time constant factor approximations on NP-Complete special instances of the Guarding a Set of Segments(GSS) problem. The input to the GSS problem consists of a set of line segments, and the goal is to find a minimum size hitting set of the given set of line segments. We consider the underlying planar graph on the set of intersection points as vertices and the edge set as pairs of vertices which are adjacent on a line segment. Our results are for the subclass of instances of GSS for which the underlying planar graph has girth at least 4. On this class of instances, we show that an optimum solution to the natural hitting set LP can be rounded to yield a 3-factor approximation to the optimum hitting set. The GSS problem remains NP-Complete on the sub-class of such instances. The main technique, that we believe could be quite general, is to round the hitting set LP optimum for special hypergraphs that we identify.
KeywordsArt gallery problem line segments hitting sets approximation algorithm
Unable to display preview. Download preview PDF.
- 1.Alon, N.: A non-linear lower bound for planar epsilon-nets. In: 2010 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 341–346 (2010)Google Scholar
- 3.Balaban, I.J.: An optimal algorithm for finding segments intersections. In: Proceedings of the Eleventh Annual Symposium on Computational Geometry, SCG 1995, pp. 211–219. ACM, New York (1995)Google Scholar
- 4.Bentley, J., Ottmann, T.: Algorithms for reporting and counting geometric intersections. IEEE Transactions on Computers C-28(9), 643–647 (1979)Google Scholar
- 14.Karp, R.M.: Reducibility Among Combinatorial Problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum Press (1972)Google Scholar
- 16.Long, P.M.: Using the pseudo-dimension to analyze approximation algorithms for integer programming. In: Proceedings of the 7th International Workshop on Algorithms and Data Structures, WADS 2001, pp. 26–37. Springer, London (2001)Google Scholar
- 20.West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall (September 2000)Google Scholar