@inbook {17639,
	title = {On the Covering Steiner Problem},
	booktitle = {FST TCS 2003: Foundations of Software Technology and Theoretical Computer ScienceFST TCS 2003: Foundations of Software Technology and Theoretical Computer Science},
	series = {Lecture Notes in Computer Science},
	volume = {2914},
	year = {2003},
	month = {2003///},
	pages = {244 - 251},
	publisher = {Springer Berlin / Heidelberg},
	organization = {Springer Berlin / Heidelberg},
	abstract = {The Covering Steiner problem is a common generalization of the k -MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with edge-costs, and some subsets of vertices called groups , with each group being equipped with a non-negative integer value (called its requirement ); the problem is to find a minimum-cost tree which spans at least the required number of vertices from every group. When all requirements are equal to 1, this is the Group Steiner problem. While many covering problems (e.g., the covering integer programs such as set cover) become easier to approximate as the requirements increase, the Covering Steiner problem remains at least as hard to approximate as the Group Steiner problem; in fact, the best guarantees previously known for the Covering Steiner problem were worse than those for Group Steiner as the requirements became large. In this work, we present an improved approximation algorithm whose guarantee equals the best known guarantee for the Group Steiner problem.},
	isbn = {978-3-540-20680-4},
	url = {http://dx.doi.org/10.1007/978-3-540-24597-1_21},
	author = {Gupta,Anupam and Srinivasan, Aravind},
	editor = {Pandya,Paritosh and Radhakrishnan,Jaikumar}
}
