Note: The relation of Connected Set Cover and Group Steiner Tree

Authors:
Khaled Elbassioni;Slobodan Jeli;Domagoj Matijevi
Affiliations:
Max-Planck-Institut für Informatik, Department 1: Algorithms and Complexity, Campus E1 4, Room 307, 66123 Saarbrücken, Germany;Josip Juraj Strossmayer University of Osijek, Department of Mathematics, Trg Ljudevita Gaja 6, Room 19, 31000 Osijek, Croatia;Josip Juraj Strossmayer University of Osijek, Department of Mathematics, Trg Ljudevita Gaja 6, Room 41, 31000 Osijek, Croatia
Venue:
Theoretical Computer Science
Year:
2012

Citing 8
Cited 0

A polylogarithmic approximation algorithm for the group Steiner tree problem

Journal of Algorithms
Approximation algorithms for the covering Steiner problem

Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
Beyond Steiner's Problem: A VLSI Oriented Generalization

WG '89 Proceedings of the 15th International Workshop on Graph-Theoretic Concepts in Computer Science
Polylogarithmic inapproximability

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Probabilistic approximation of metric spaces and its algorithmic applications

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Algorithms for connected set cover problem and fault-tolerant connected set cover problem

Theoretical Computer Science
Online Node-Weighted Steiner Tree and Related Problems

FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
Connected set cover problem and its applications

AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management

Quantified Score

Hi-index	5.23

Visualization

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.