Independence and coloring problems on intersection graphs of disks

Authors:
Thomas Erlebach;Jiří Fiala
Affiliations:
Computer Engineering and Networks Lab, ETH Zürich, Zürich, Switzerland;Faculty of Mathematics and Physics, Department of Applied Mathematics and Institute for Theoretical Computer Science, Charles University, Prague, Czech Republic
Venue:
Efficient Approximation and Online Algorithms
Year:
2006

Citing 22
Cited 3

A study on two geometric location problems

Information Processing Letters
Unit disk graphs

Discrete Mathematics - Topics on domination
Approximation algorithms for NP-complete problems on planar graphs

Journal of the ACM (JACM)
A special planar satisfiability problem and a consequence of its NP-completeness

Discrete Applied Mathematics
Coin graphs, polyhedra, and conformal mapping

Proceedings of the 2nd Slovenian conference on Algebraic and topological methods in graph theory
Approximation schemes for covering and packing problems in image processing and VLSI

Journal of the ACM (JACM)
NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs

Journal of Algorithms
Unit disk graph recognition is NP-hard

Computational Geometry: Theory and Applications - Special issue on geometric representations of graphs
Approximating discrete collections via local improvements

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Improved approximation algorithms for rectangle tiling and packing

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Robust algorithms for restricted domains

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
Representing graphs by disks and balls (a survey of recognition-complexity results)

Discrete Mathematics
On-line coloring of geometric intersection graphs

Computational Geometry: Theory and Applications
On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Approximation Algorithms for Maximum Independent Set Problems and Fractional Coloring Problems on Unit Disk Graphs

JCDCG '98 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Approximate Strong Separation with Application in Fractional Graph Coloring and Preemptive Scheduling

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
On the Complexity of Recognizing Intersection and Touching Graphs of Disks

GD '95 Proceedings of the Symposium on Graph Drawing
On the Clique Problem in Intersection Graphs of Ellipses

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Online and Offline Distance Constrained Labeling of Disk Graphs

ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Polynomial-time approximation schemes for packing and piercing fat objects

Journal of Algorithms
A robust PTAS for maximum weight independent sets in unit disk graphs

WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science

A tight bound for online colouring of disk graphs

Theoretical Computer Science
SIGACT news online algorithms column 14

ACM SIGACT News
Location oblivious distributed unit disk graph coloring

SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

This chapter surveys on-line and approximation algorithms for the maximum independent set and coloring problems on intersection graphs of disks. It includes a more detailed treatment of recent upper and lower bounds on the competitive ratio of on-line algorithms for coloring such graphs.