Geometry based heuristics for unit disk graphs
<|reference_start|>Geometry based heuristics for unit disk graphs: Unit disk graphs are intersection graphs of circles of unit radius in the plane. We present simple and provably good heuristics for a number of classical NP-hard optimization problems on unit disk graphs. The problems considered include maximum independent set, minimum vertex cover, minimum coloring and minimum dominating set. We also present an on-line coloring heuristic which achieves a competitive ratio of 6 for unit disk graphs. Our heuristics do not need a geometric representation of unit disk graphs. Geometric representations are used only in establishing the performance guarantees of the heuristics. Several of our approximation algorithms can be extended to intersection graphs of circles of arbitrary radii in the plane, intersection graphs of regular polygons, and to intersection graphs of higher dimensional regular objects.<|reference_end|>
@article{marathe1994geometry,
    title={Geometry based heuristics for unit disk graphs},
    author={Madhav V. Marathe, H. Breu, Harry B. Hunt III, S. S. Ravi, Daniel J.
  Rosenkrantz},
    journal={arXiv preprint arXiv:math/9409226},
    year={1994},
    number={LACES 68Q-94-22},
    archivePrefix={arXiv},
    eprint={math/9409226},
    primaryClass={math.CO cs.CC}
}