Independent and Hitting Sets of Rectangles Intersecting a Diagonal Line: Algorithms and Complexity

Finding a maximum independent set of a given family of axis-parallel rectangles is a basic problem in computational geometry and combinatorics. This problem has attracted significant attention since the sixties, when Wegner conjectured that the corresponding duality gap, i.e., the maximum possible ratio between the maximum independent set and the minimum hitting set, is bounded by a universal constant. In this paper we improve upon recent results of Chepoi and Felsner and prove that when the given family of rectangles is intersected by a diagonal, this ratio is between 2 and 4. For the upper bound we derive a simple combinatorial argument that first allows us to reprove results of Hixon, and Chepoi and Felsner and then we adapt this idea to obtain the improved bound in the diagonal intersecting case. From a computational complexity perspective, although for general rectangle families the problem is known to be NP-hard, we derive an O(n 2)-time algorithm for the maximum weight independent set when, in addition to intersecting a diagonal, the rectangles intersect below it. This improves and extends a classic result of Lubiw. As a consequence, we obtain a 2-approximation algorithm for the maximum weight independent set of rectangles intersecting a diagonal.

[1]  Gábor Tardos,et al.  On point covers of multiple intervals and axis-parallel rectangles , 1996, Comb..

[2]  José R. Correa,et al.  Independent and Hitting Sets of Rectangles Intersecting a Diagonal Line: Algorithms and Complexity , 2013, Discret. Comput. Geom..

[3]  José A. Soto,et al.  Jump Number of Two-Directional Orthogonal Ray Graphs , 2011, IPCO.

[4]  András Gyárfás,et al.  Covering and coloring problems for relatives of intervals , 1985, Discret. Math..

[5]  Micha Sharir,et al.  Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes , 2010, SIAM J. Comput..

[6]  Chuan Yi Tang,et al.  An Efficient Algorithm for Finding a Maximum Weight 2-Independent Set on Interval Graphs , 1992, Inf. Process. Lett..

[7]  Christopher Thraves,et al.  (c-)AND(1) graphs - more than intersection, more than geometric , 2013, ArXiv.

[8]  Timothy M. Chan,et al.  Approximation Algorithms for Maximum Independent Set of Pseudo-Disks , 2009, Discrete & Computational Geometry.

[9]  Nabil H. Mustafa,et al.  Improved Results on Geometric Hitting Set Problems , 2010, Discret. Comput. Geom..

[10]  Anna Lubiw,et al.  A weighted min-max relation for intervals , 1990, J. Comb. Theory, Ser. B.

[11]  G. Wegner,et al.  Über eine kombinatorisch-geometrische Frage von Hadwiger und Debrunner , 1965 .

[12]  Andreas Wiese,et al.  Approximation Schemes for Maximum Weight Independent Set of Rectangles , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[13]  M. Yannakakis.  The Complexity of the Partial Order Dimension Problem , 1982 .

[14]  Robert J. Fowler,et al.  Optimal Packing and Covering in the Plane are NP-Complete , 1981, Inf. Process. Lett..

[15]  Parinya Chalermsook,et al.  Maximum independent set of rectangles , 2009, SODA.

[16]  Alexandr V. Kostochka,et al.  Covering boxes by points , 1993, Discret. Math..

[17]  Stefan Felsner,et al.  Approximating hitting sets of axis-parallel rectangles intersecting a monotone curve , 2013, Comput. Geom..

[18]  Takao Asano,et al.  Finding the Connected Components and a Maximum Clique of an Intersection Graph of Rectangles in the Plane , 1983, J. Algorithms.