The relation of connected set cover and group Steiner tree
From MaRDI portal
(Redirected from Publication:441864)
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
Cites work
- scientific article; zbMATH DE number 219265 (Why is no real title available?)
- A Greedy Heuristic for the Set-Covering Problem
- A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
- Algorithms for connected set cover problem and fault-tolerant connected set cover problem
- Approximating fault-tolerant group-Steiner problems
- Approximation algorithms for the covering Steiner problem
- Connected Set Cover Problem and Its Applications
- Online node-weighted Steiner tree and related problems
- Polylogarithmic inapproximability
- Requiring connectivity in the set covering problem
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)