Abstract
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(loglogn) approximation algorithm for unweighted MISR, matching the result by Chalermsook and Chuzhoy, and (ii) O(loglogn)-approximation algorithm for the MISR instances arising in the Unsplittable Flow Problem on paths. Our technique builds on and generalizes past works.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Agarwal, P.K., van Kreveld, M.J., Suri, S.: Label placement by maximum independent set in rectangles. Comput. Geom. 11(3-4), 209–218 (1998)
Ahlswede, R., Karapetyan, I.: Intersection graphs of rectangles and segments. In: Ahlswede, R., Bäumer, L., Cai, N., Aydinian, H., Blinovsky, V., Deppe, C., Mashurian, H. (eds.) General Theory of Information Transfer and Combinatorics. LNCS, vol. 4123, pp. 1064–1065. Springer, Heidelberg (2006)
Asplund, E., Grunbaum, B.: On a coloring problem. Math. Scand. 8, 181–188 (1960)
Bar-Yehuda, R., Hermelin, D., Rawitz, D.: Minimum vertex cover in rectangle graphs. In: de Berg, M., Meyer, U. (eds.) ESA 2010. LNCS, vol. 6346, pp. 255–266. Springer, Heidelberg (2010)
Berman, P., DasGupta, B., Muthukrishnan, S., Ramaswami, S.: Improved approximation algorithms for rectangle tiling and packing. In: SODA, pp. 427–436 (2001)
Bielecki, A.: Problem 56. Colloq. Math. 1, 333 (1948)
Bonsma, P., Schulz, J., Wiese, A.: A constant factor approximation algorithm for unsplittable flow on paths. In: Arxiv (2011)
Chalermsook, P., Chuzhoy, J.: Maximum independent set of rectangles. In: SODA, pp. 892–901 (2009)
Chan, T.M.: Polynomial-time approximation schemes for packing and piercing fat objects. J. Algorithms 46(2), 178–189 (2003)
Chan, T.M.: A note on maximum independent sets in rectangle intersection graphs. Inf. Process. Lett. 89(1), 19–23 (2004)
Chan, T.M., Har-Peled, S.: Approximation algorithms for maximum independent set of pseudo-disks. In: Symposium on Computational Geometry, pp. 333–340 (2009)
Christodoulou, G., Elbassioni, K., Fouz, M.: Truthful mechanisms for exhibitions. In: Saberi, A. (ed.) WINE 2010. LNCS, vol. 6484, pp. 170–181. Springer, Heidelberg (2010)
Doerschler, J.S., Freeman, H.: A rule-based system for dense-map name placement. Commun. ACM 35(1), 68–79 (1992)
Erdös, P.: Graph theory and probability. Canadian J. of Mathematics 11, 34–38 (1959)
Erlebach, T., Jansen, K., Seidel, E.: Polynomial-time approximation schemes for geometric graphs. In: SODA, pp. 671–679 (2001)
Fowler, R.J., Paterson, M., Tanimoto, S.L.: Optimal packing and covering in the plane are np-complete. Inf. Process. Lett. 12(3), 133–137 (1981)
Fukuda, T., Morimoto, Y., Morishita, S., Tokuyama, T.: Data mining with optimized two-dimensional association rules. ACM Trans. Database Syst. 26(2), 179–213 (2001)
Hendler, C.: Schranken fur farbungs-und cliquenuberdeckungszahl geometrisch represdntierbarer graphen. Master Thesis (1998)
Imai, H., Asano, T.: Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane. J. Algorithms 4(4), 310–323 (1983)
Khanna, S., Muthukrishnan, S., Paterson, M.: On approximating rectangle tiling and packing. In: SODA, pp. 384–393 (1998)
Kostochka, A.V.: Coloring intersection graphs of geometric figures with a given clique number. Contemporary Mathematics 342 (2004)
Lent, B., Swami, A.N., Widom, J.: Clustering association rules. In: ICDE, pp. 220–231 (1997)
Lewin-Eytan, L., Naor, J(S.), Orda, A.: Routing and admission control in networks with advance reservations. In: Jansen, K., Leonardi, S., Vazirani, V.V. (eds.) APPROX 2002. LNCS, vol. 2462, pp. 215–228. Springer, Heidelberg (2002)
Nielsen, F.: Fast stabbing of boxes in high dimensions. Theor. Comput. Sci. 246(1-2), 53–72 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chalermsook, P. (2011). Coloring and Maximum Independent Set of Rectangles. In: Goldberg, L.A., Jansen, K., Ravi, R., Rolim, J.D.P. (eds) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. APPROX RANDOM 2011 2011. Lecture Notes in Computer Science, vol 6845. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22935-0_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-22935-0_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22934-3
Online ISBN: 978-3-642-22935-0
eBook Packages: Computer ScienceComputer Science (R0)