Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs
A box graph is the intersection graph of a finite set of orthogonal rectangles in the plane. The problem of whether or not the maximum independent set problem (MIS for short) for box graphs can be approximated within a substantially sub-logarithmic factor in polynomial time has been open for several years. We show that for box graphs on n vertices which have an independent set of size Ω(n/log O(1) n) the maximum independent set problem can be approximated within O(logn / loglogn) in polynomial time. Furthermore, we show that the chromatic number of a box graph on n vertices is within an O(logn) factor from the size of its maximum clique and provide an O(logn) approximation algorithm for minimum vertex coloring of such a box graph. More generally, we can show that the chromatic number of the intersection graph of n d-dimensional orthogonal rectangles is within an O(log d − 1 n) factor from the size of its maximum clique and obtain an O(log d − 1 n) approximation algorithm for minimum vertex coloring of such an intersection graph.
KeywordsPolynomial Time Geographic Information System Chromatic Number Maximum Clique Intersection Graph
Unable to display preview. Download preview PDF.
- 6.Chlebik, M., Chlebiková, J.: Approximation Hardness of Optimization Problems in Intersection Graphs of d-dimensional Boxes. In: Proc. SODA, pp. 267–276 (2005)Google Scholar
- 7.Erlebach, T., Jansen, K., Seidel, E.: Polynomial-Time Approximation Schemes for Geometric Graphs. In: Proc. SODA, pp. 671–679 (2001)Google Scholar
- 13.Malesinska, E.: Graph-Theoretical Models for Frequency Assignment Problems. PhD Thesis, TU Berlin (1997)Google Scholar
- 15.Preparata, F., Shamos, M.: Computational Geometry – an Introduction. Springer, New York (1985)Google Scholar