The relation of connected set cover and group Steiner tree
DOI10.1016/J.TCS.2012.02.035zbMATH Open1246.05148OpenAlexW2020427431MaRDI QIDQ441864FDOQ441864
Authors: Slobodan Jelić, Domagoj Matijević, Khaled Elbassioni 
Publication date: 8 August 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.02.035
Recommendations
- Algorithms for connected set cover problem and fault-tolerant connected set cover problem
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Approximation algorithms for the covering Steiner problem
- A simple approximation algorithm for minimum weight partial connected set cover
- scientific article; zbMATH DE number 5899242
group Steiner treeset coverconnected set covercovering Steiner tree problemnode weighted group Steiner treeweighted connected set cover
Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- A Greedy Heuristic for the Set-Covering Problem
- Polylogarithmic inapproximability
- A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
- Algorithms for connected set cover problem and fault-tolerant connected set cover problem
- Requiring connectivity in the set covering problem
- Approximation algorithms for the covering Steiner problem
- Approximating fault-tolerant group-Steiner problems
- Title not available (Why is that?)
- Connected Set Cover Problem and Its Applications
- Online node-weighted Steiner tree and related problems
Cited In (4)
This page was built for publication: The relation of connected set cover and group Steiner tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q441864)
