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

  • Authors:

  • Lei Chen;Changhong Lu;Zhenbing Zeng

  • Affiliations:

  • Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai, 200062, China;Department of Mathematics, East China Normal University, Shanghai, 200241, China;Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai, 200062, China

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2009

Quantified Score

Hi-index 5.23

Visualization

Abstract

Let G=(V,E) be a simple graph without isolated vertices. A vertex set S@?V is a paired-dominating set if every vertex in V-S has a neighbor in S and the induced subgraph G[S] 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.