Approximation algorithms and hardness for domination with propagation

Details Approximation algorithms and hardness for domination with propagation Approximation algorithms and hardness for domination with propagation

2007-10-10

arxiv.org/abs/0710.2139v1

Computer Science

Computational Complexity

Scientific paper

The power dominating set (PDS) problem is the following extension of the well-known dominating set problem: find a smallest-size set of nodes $S$ that power dominates all the nodes, where a node $v$ is power dominated if (1) $v$ is in $S$ or $v$ has a neighbor in $S$, or (2) $v$ has a neighbor $w$ such that $w$ and all of its neighbors except $v$ are power dominated. We show a hardness of approximation threshold of $2^{\log^{1-\epsilon}{n}}$ in contrast to the logarithmic hardness for the dominating set problem. We give an $O(\sqrt{n})$ approximation algorithm for planar graphs, and show that our methods cannot improve on this approximation guarantee. Finally, we initiate the study of PDS on directed graphs, and show the same hardness threshold of $2^{\log^{1-\epsilon}{n}}$ for directed \emph{acyclic} graphs. Also we show that the directed PDS problem can be solved optimally in linear time if the underlying undirected graph has bounded tree-width.

Affiliated with

Also associated with

No associations

Rating

Approximation algorithms and hardness for domination with propagation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Approximation algorithms and hardness for domination with propagation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximation algorithms and hardness for domination with propagation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-541253