Approximation algorithms for connected dominating sets
- 1 January 1996
- book chapter
- Published by Springer Nature
- p. 179-193
- https://doi.org/10.1007/3-540-61680-2_55
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Locating faults in a systematic manner in a large heterogeneous networkPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A threshold of ln n for approximating set cover (preliminary version)Published by Association for Computing Machinery (ACM) ,1996
- A tight analysis of the greedy algorithm for set coverPublished by Association for Computing Machinery (ACM) ,1996
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner TreesJournal of Algorithms, 1995
- Approximation algorithms for geometric tour and network design problems (extended abstract)Published by Association for Computing Machinery (ACM) ,1995
- On the hardness of approximating minimization problemsJournal of the ACM, 1994
- Approximating the tree and tour covers of a graphInformation Processing Letters, 1993
- Spanning Trees with Many LeavesSIAM Journal on Discrete Mathematics, 1991
- Depth-first search and the vertex cover problemInformation Processing Letters, 1982