A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
The Approximability and Integrality Gap of Interval Stabbing and Independence Problems
2012
Canadian Conference on Computational Geometry
Motivated by problems such as rectangle stabbing in the plane, we study the minimum hitting set and maximum independent set problems for families of d-intervals and d-union-intervals. We obtain the following: (1) constructions yielding asymptotically tight lower bounds on the integrality gaps of the associated natural linear programming relaxations; (2) an LP-relative dapproximation for the hitting set problem on d-intervals; (3) a proof that the approximation ratios for independent set on
dblp:conf/cccg/Ben-DavidGMS12
fatcat:bqo6cp7ol5ebzm7nlpjbbwz2j4