Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4110 LNCS, Issue , 2006, Pages 3-14

  Ambühl, Christoph ^a   Erlebach, Thomas ^b   Mihal'ák, Matúš ^b   Nunkesser, Marc ^c  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

^b UNIVERSITY OF LEICESTER   (United Kingdom)

^c ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DYNAMIC PROGRAMMING; GRAPH THEORY; PROBLEM SOLVING;

AD-HOC NETWORKS; APPROXIMATION ALGORITHMS; DISK GRAPHS; SET PROBLEM;

SET THEORY;

EID: 33750054976     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11830924_3     Document Type: Conference Paper

References (18)

1. K. Alzoubi, P.-J. Wan, and O. Frieder. Message-optimal connected dominating sets in mobile ad hoc networks. In Proceedings of the 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2002), pages 157-164, 2002.
2. C. Ambühl, T. Erlebach, M. Mihal'ák, and M. Nunkesser. Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs. Research Report CS-06-008, Department of Computer Science, University of Leicester, June 2006.
3. B. S. Baker. Approximation algorithms for NP-complete problems on planar graphs. Journal of the ACM, 41(1):153-180, 1994.
4. Extended abstract published in the proceedings of FOCS'83, pp. 265-273, 1983.
5. H. Brönnimann and M. T. Goodrich. Almost optimal set covers in finite VC-dimension. Discrete & Computational Geometry, 14(4):463-479, 1995.
6. G. Calinescu, I. Mandoiu, P.-J. Wan, and A. Zelikovsky. Selecting forwarding neighbors in wireless ad hoc networks. Mobile Networks and Applications, 9(2):101-111, 2004.
7. X. Cheng, X. Huang, D. Li, W. Wu, and D.-Z. Du. A polynomial-time approximation scheme for the minimum-connected dominating set in ad hoc wireless networks. Networks, 42(4):202-208, 2003.
8. B. N. Clark, C. J. Colbourn, and D. S. Johnson. Unit disk graphs. Discrete Mathematics, 86:165-177, 1990.
9. U. Feige. A threshold of Inn for approximating set cover. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing (STOC'96), pages 314-318, 1996.
10. M. R. Garey and D. S. Johnson. Computers and Intractability. A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York-San Francisco, 1979.
11. S. Guha and S. Khuller. Improved methods for approximating node weighted Steiner trees and connected dominating sets. Information and Computation, 150(1):57-74, 1999.
12. D. S. Hochbaum and W. Maass. Approximation schemes for covering and packing problems in image processing and VLSI. Journal of the ACM, 32(1):130-136, 1985.
13. H. B. Hunt III, M. V. Marathe, V. Radhakrishnan, S. S. Ravi, D. J. Rosenkrantz, and R. E. Stearns. NC-Approximation schemes for NP- and PSPACE-hard problems for geometric graphs. Journal of Algorithms, 26(2)-.238-274, 1998.
14. D. Lichtenstein. Planar formulae and their uses. SIAM Journal on Computing, 11(2):329-343, 1982.
15. M. V. Marathe, H. Breu, H. B. Hunt III, S. S. Ravi, and D. J. Rosenkrantz. Simple heuristics for unit disk graphs. Networks, 25:59-68, 1995.
16. E. J. van Leeuwen. Approximation algorithms for unit disk graphs. In Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science (WG'05), LNCS 3787, pages 351-361, 2005.
17. V. V. Vazirani. Approximation Algorithms. Springer, 2001.
18. Y. Wang and X.-Y. Li. Distributed low-cost backbone formation for wireless ad hoc networks. In Proceedings of the 6th ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2005), pages 2-13, 2005.