2008 | OriginalPaper | Buchkapitel
Double Partition: (6 + ε)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs
verfasst von : Ding-Zhu Du
Erschienen in: Algorithmic Aspects in Information and Management
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We introduce a new technique on partition, called double partition. With this new type of partition, we obtain a polynomial time (6 +
ε
)-approximation (
ε
> 0) for the minimum weight dominating set problem in unit disk graphs, which improves a recent result of a 72-approximation given by Ambühl et al. for solving a long-standing open problem. As a corollary, we obtain a (9.875 +
ε
)-approximation for the minimum weight connected dominating set problem in unit disk graphs.