The Steiner Tree problem has appeared in the Karp's list of the first 21 NP-hard problems and is well known as one of the most fundamental problems in Network Design area. We study the Node-Weighted version of the Prize
Collecting Steiner Tree problem.
In this problem, we are given a simple graph with a cost and penalty value associated with each node. Our
goal is to find a subtree T of the graph minimizing the cost of the
nodes in T plus penalty of the nodes not in T. By a reduction
from set cover problem it can be easily shown that the problem cannot be approximated in polynomial time within factor of (1-o(1))ln n unless NP has quasi-polynomial time algorithms, where n is the number of vertices of the graph.
Moss and Rabani claimed an O(log n)-approximation algorithm for the problem using a Primal-Dual approach in their STOC'01 paper \cite{moss2001}. We show that their algorithm is incorrect by providing a counter example in which there is an O(n) gap between the dual solution constructed by their algorithm and the optimal solution. Further, evidence is given that their algorithm probably does not have a simple fix. We propose a new algorithm which is more involved and
introduces novel ideas in primal dual approach for network design problems. Also, our algorithm is a Lagrangian Multiplier Preserving algorithm and we show how this property can be utilized to design an O(log n)-approximation algorithm for the Node-Weighted Quota Steiner Tree problem
using the Lagrangian Relaxation method.
We also show an application of the Node Weighted Quota Steiner Tree problem in designing algorithm with better approximation factor for
Technology Diffusion problem, a problem proposed by Goldberg and Liu
in \cite{goldberg2012} (SODA 2013). In Technology Diffusion, we are given a graph G and a threshold θ(v) associated with each vertex v and we are seeking a set of initial nodes called the seed set.
Technology Diffusion is a dynamic process defined over time in which each vertex is either active or inactive. The vertices in the seed set
are initially activated and each other vertex v gets activated whenever there are at least θ(v) active nodes connected to
v through other active nodes. The Technology Diffusion problem asks to
find the minimum seed set activating all nodes. Goldberg
and Liu gave an O(rllog n)-approximation algorithm for the problem where
r and l are the diameter of G and the number of distinct threshold values, respectively. We improve the approximation factor
to O(min{r,l}log n) by establishing a close connection between the problem and the Node Weighted Quota Steiner Tree problem.
| Identifer | oai:union.ndltd.org:WATERLOO/oai:uwspace.uwaterloo.ca:10012/7557 |
| Date | January 2013 |
| Creators | Sadeghian Sadeghabad, Sina |
| Source Sets | University of Waterloo Electronic Theses Repository |
| Language | English |
| Detected Language | English |
| Type | Thesis or Dissertation |
Page generated in 0.0023 seconds