Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Du, DZ. (2008). Double Partition: (6 + ε)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs. In: Fleischer, R., Xu, J. (eds) Algorithmic Aspects in Information and Management. AAIM 2008. Lecture Notes in Computer Science, vol 5034. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68880-8_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-68880-8_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68865-5
Online ISBN: 978-3-540-68880-8
eBook Packages: Computer ScienceComputer Science (R0)