Simple heuristics for unit disk graphs

doi:10.1002/net.3230250205

Simple heuristics for unit disk graphs

2006-10-11

0

OA

AI

DOI：10.1002/net.3230250205

原文链接

查看原文

摘要

En 中文

AbstractUnit 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 intersection graphs of higher dimensional regular objects.

Simple heuristics for unit disk graphs

摘要

AI总结

期刊

机构

引用论文