Hardness results and approximation algorithms of k-tuple domination in graphs

Information Processing Letters

Volumn 89, Issue 2, 2004, Pages 75-83

  Klasing, Ralf ^a   Laforest, Christian ^b  

^a UNIVERSITY OF NICE SOPHIA ANTIPOLIS   (France)

^b UNIVERSITÉ D EVRY VAL D ESSONNE   (France)

Author keywords

Approximation algorithms; Combinatorial problems; Domination problems

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; OPTIMIZATION; POLYNOMIAL APPROXIMATION; SET THEORY; THEOREM PROVING;

APPROXIMATION ALGORITHMS; CHORDAL GRAPHS;

TREES (MATHEMATICS);

EID: 0347412014     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2003.10.004     Document Type: Article

References (13)

1. Alimonti P., Kann V. Hardness of approximating problems on cubic graphs. Theoret. Comput. Sci. 237:2000;123-134.
2. Alzoubi K., Wang P.-J., Frieder O. Distributed heuristics for connected dominating sets in wireless ad hoc networks. J. Comm. Networks. 4:2002;1-8.
3. Ausiello G., Crescenzi P., Gambosi G., Kann V., Marchetti-Spaccamela A., Protasi M. Complexity and Approximation. 1999;Springer, Berlin.
4. Chang G.J. Algorithmic aspects of domination in graphs. Du D.-Z., Pardalos P.M. Handbook of Combinatorial Optimization. 3:1998;339-405 Kluwer Academic Publishers, Dordrecht.
5. Cormen T., Leiserson C., Rivest R. Introduction to Algorithms. 1990;MIT Press, Cambridge, MA.
6. Feige U. A threshold of lnn for approximating set cover. J. ACM. 45:1998;634-652.
7. Harary F., Haynes T. Double domination in graphs. Ars Combin. 55:2000;201-213.
8. Haynes T.W., Hedetniemi S.T., Slater P.J. Domination in Graphs: Advanced Topics. 1998;Marcel Dekker Inc. New York.
9. Haynes T.W., Hedetniemi S.T., Slater P.J. Domination in Graphs: The Theory. 1998;Marcel Dekker Inc. New York.
10. Hochbaum D. Approximation Algorithms for NP-Hard Problems. 1997;PWS Publishing Company, Boston, MA.
11. Liao C.-S., Chang G.J. Algorithmic aspects of k -tuple domination in graphs. Taiwanese J. Math. 6:2002;415-420.
12. Liao C.-S., Chang G.J. k -tuple domination in graphs. Inform. Process. Lett. 87:2003;45-50.
13. Marathe M.V., Breu H., Hunt H.B. III, Ravi S.S., Rosenkrantz D.J. Simple heuristics for unit disk graphs. Networks. 25:1995;59-68.