A simple heuristic for minimum connected dominating set in graphs

International Journal of Foundations of Computer Science

Volumn 14, Issue 2, 2003, Pages 323-333

  Wan, Peng Jun ^a   Alzoubi, Khaled M ^a   Frieder, Ophir ^a  

^a Illinois Institute of Technology   (United States)

Author keywords

2 independent set; approximation algorithm; connected dominating set; minor

Indexed keywords

EID: 4243106665     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054103001753     Document Type: Article

References (12)

1. K. M. Alzoubi, Virtual Backbone in Wireless Ad Hoc Networks, PhD dissertaion, Department of Computer Science, Illinois Institute of Technology, 2002.
2. B. S. Baker, "Approximation algorithms for NP-complete problems on planar graphs", Journal of the ACM, 41(1):153-180, 1994.
3. V. Bharghavan, and B. Das, "Routing in Ad Hoc Networks Using Minimum Connected Dominating SetsInternational Conference on Communications'97, Montreal, Canada. June 1997
4. X. Cheng, X. Huang, D. Li, and D.-Z. Du, "Polynomial-Time Approximation Scheme for Minimum Connected Dominating Set in Ad Hoc Wireless Networks", Technical Report 02-003, Department of Computer Sceince and Engineering, University of Minnesota.
5. B. N. Clark, C. J. Colbourn, and D. S. Johnson, "Unit Disk Graphs", Discrete Mathematics, 86:165-177, 1990.
6. P. Duchet, and H. Meyniel, "On Hadwiger's number and stability numbers", Annal. Disc. Math. 13 (1982), 71-74.
7. U. Feige, "A threshold of Inn for approximating set-cover", 28th ACM Symposium on Theory of Computing
8. M. R. Garey, and D. S. Johnson, Computers and Intractability: a Guide to the Theory of NP-Completeness, W. H. Freeman and Company, 1979.
9. S. Guha, and S. Khuller, "Approximation algorithms for connected dominating sets", Algorithmica, 20(4):374-387, April 1998.
10. C. Lund, and M. Yannakakis, "On the hardness of approximating minimization problems", Journal of the ACM, 41(5): 960-981, (1994).
11. M. V. Marathe, H. Breu, H. B. Hunt III, S. S. Ravi, and D. J. Rosenkrantz, "Simple Heuristics for Unit Disk Graphs", Networks, Vol. 25, 1995, pp. 59-68.
12. P.-J. Wan, K. M. Alzoubi, and O. Frieder, "Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks", IEEE INFOCOM 2002.