Abstract
It was a long-standing open problem whether the minimum weight dominating set in unit disk graphs has a polynomial-time constant-approximation. In 2006, Ambühl et al solved this problem by presenting a 72-approximation for the minimum weight dominating set and also a 89-approximation for the minimum weight connected dominating set in unit disk graphs. In this paper, we improve their results by giving a (6 + ε)-approximation for the minimum weight dominating set and a (10 + ε)-approximation for the minimum weight connected dominating set in unit disk graphs where ε is any small positive number.
Support in part by National Science Foundation of USA under grants CCF-9208913 and CCF-0728851; and in part by NSFC (60603003) and XJEDU.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ambühl, C., Erlebach, T., Mihalák, M., Nunkesser, M.: Constant-Approximation for Minimum-Weight (Connected) Dominating Sets in Unit Disk Graphs. In: Díaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX 2006 and RANDOM 2006. LNCS, vol. 4110, pp. 3–14. Springer, Heidelberg (2006)
Chen, D., Du, D.-Z., Hu, X.-D., Lin, G.-H., Wang, L., Xue, G.: Approximations for Steiner Trees with Minimum Number of Steiner Points. Theoretical Computer Science 262, 83–99 (2001)
Cheng, X., Huang, X., Li, D., Wu, W., Du, D.-Z.: A Polynomial-Time Approximation Scheme for the Minimum-Connected Dominating Set in Ad Hoc Wireless Networks. Networks 42, 202–208 (2003)
Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit Disk Graphs. Discrete Mathematics 86, 165–177 (1990)
Mandoiu, I., Zelikovsky, A.: A Note on the MST Heuristic for Bounded Edge-Length Steiner Trees with Minimum Number of Steiner Points. Information Processing Letters 75(4), 165–167 (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gao, X., Huang, Y., Zhang, Z., Wu, W. (2008). (6 + ε)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs. In: Hu, X., Wang, J. (eds) Computing and Combinatorics. COCOON 2008. Lecture Notes in Computer Science, vol 5092. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69733-6_54
Download citation
DOI: https://doi.org/10.1007/978-3-540-69733-6_54
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69732-9
Online ISBN: 978-3-540-69733-6
eBook Packages: Computer ScienceComputer Science (R0)