Search

Showing total 1 results
1 results

1. Hardness results and approximation algorithms for (weighted) paired-domination in graphs

Author

Chen, Lei, Lu, Changhong, and Zeng, Zhenbing

Subjects
*APPROXIMATION theory, *ALGORITHMS, *DOMINATING set, *GRAPH theory, *DYNAMIC programming, *COMBINATORICS, *COMPUTER science, *MATHEMATICAL analysis
Abstract

Abstract: Let be a simple graph without isolated vertices. A vertex set is a paired-dominating set if every vertex in has a neighbor in and the induced subgraph has a perfect matching. In this paper, we investigate the approximation hardness of paired-domination in graphs. For weighted paired-domination, an approximation algorithm in general graphs and an exact dynamic programming style algorithm in trees are also given. [Copyright &y& Elsevier]

Published
2009
Full Text
View/download PDF