A rule-based system for dense-map name placement
Communications of the ACM
Label placement by maximum independent set in rectangles
WADS '97 Selected papers presented at the international workshop on Algorithms and data structure
On approximating rectangle tiling and packing
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Fast stabbing of boxes in high dimensions
Theoretical Computer Science
Improved approximation algorithms for rectangle tiling and packing
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Polynomial-time approximation schemes for geometric graphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Data Mining with optimized two-dimensional association rules
ACM Transactions on Database Systems (TODS)
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Routing and Admission Control in Networks with Advance Reservations
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Polynomial-time approximation schemes for packing and piercing fat objects
Journal of Algorithms
Maximum independent set of rectangles
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Approximation algorithms for maximum independent set of pseudo-disks
Proceedings of the twenty-fifth annual symposium on Computational geometry
Minimum vertex cover in rectangle graphs
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Truthful mechanisms for exhibitions
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Intersection graphs of rectangles and segments
General Theory of Information Transfer and Combinatorics
Hi-index | 0.00 |
In this paper, we consider two geometric optimization problems: Rectangle Coloring problem (RCOL) and Maximum Independent Set of Rectangles (MISR). In RCOL, we are given a collection of n rectangles in the plane where overlapping rectangles need to be colored differently, and the goal is to find a coloring using minimum number of colors. Let q be the maximum clique size of the instance, i.e. the maximum number of rectangles containing the same point. We are interested in bounding the ratio σ(q) between the total number of colors used and the clique size. This problem was first raised by graph theory community in 1960 when the ratio of σ(q) = O(q) was proved. Over decades, except for special cases, only the constant in front of q has been improved. In this paper, we present a new bound for σ(q) that significantly improves the known bounds for a broad class of instances. The bound σ(q) has a strong connection with the integrality gap of natural LP relaxation for MISR, in which the input is a collection of rectangles where each rectangle is additionally associated with non-negative weight, and our objective is to find a maximum-weight independent set of rectangles. MISR has been studied extensively and has applications in various areas of computer science. Our new bounds for RCOL imply new approximation algorithms for a broad class of MISR, including (i) O(log log n) approximation algorithm for unweighted MISR, matching the result by Chalermsook and Chuzhoy, and (ii) O(log log n)-approximation algorithm for the MISR instances arising in the Unsplittable Flow Problem on paths. Our technique builds on and generalizes past works.