| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 434825 | Theoretical Computer Science | 2012 | 6 Pages |
Abstract
We report that the Connected Set Cover (CSC) problem is just a special case of the Group Steiner Tree (GST) problem. Based on that we obtain the first algorithm for CSC with polylogarithmic approximation guarantee as well as the first approximation algorithms for the weighted version of the problem and the version with requirements. Moreover, we argue that the inapproximability result of GST will carry on to the weighted version of the CSC problem.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
