Approximation algorithms for the covering Steiner problem
From MaRDI portal
Recommendations
Cites work
- A 2.5-factor approximation algorithm for the k-MST problem
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
- Geometric algorithms and combinatorial optimization
- scientific article; zbMATH DE number 1256763 (Why is no real title available?)
- scientific article; zbMATH DE number 1303564 (Why is no real title available?)
- scientific article; zbMATH DE number 1775395 (Why is no real title available?)
- scientific article; zbMATH DE number 1775400 (Why is no real title available?)
- scientific article; zbMATH DE number 1445321 (Why is no real title available?)
- scientific article; zbMATH DE number 1445374 (Why is no real title available?)
- New approaches to covering and packing problems
- On approximating planar metrics by tree metrics.
- Poisson approximation for large deviations
- Spanning Trees—Short or Small
- Weighted k‐cardinality trees: Complexity and polyhedral structure
Cited in
(22)- Exact solutions for the Steiner path cover problem on special graph classes
- Meet and merge: approximation algorithms for confluent flows
- The polymatroid Steiner problems
- A greedy approximation algorithm for the group Steiner problem
- Approximation algorithms for union and intersection covering problems
- An FPTAS for the fractional group Steiner tree problem
- scientific article; zbMATH DE number 5899242 (Why is no real title available?)
- Universal approximations for TSP, Steiner tree, and set cover
- Approximation Algorithms for Edge-Covering Problem
- On the approximability of dense Steiner problems
- scientific article; zbMATH DE number 1303564 (Why is no real title available?)
- The relation of connected set cover and group Steiner tree
- The minimum vulnerability problem
- scientific article; zbMATH DE number 1445321 (Why is no real title available?)
- RNC-approximation algorithms for the steiner problem
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Algorithms and Computation
- Approximations for the Steiner multicycle problem
- Russian doll search for the Steiner triple covering problem
- Adaptive-adversary-robust algorithms via small copy tree embeddings
- From directed Steiner tree to directed polymatroid Steiner tree in planar graphs
- Approximation algorithms for requirement cut on graphs
This page was built for publication: Approximation algorithms for the covering Steiner problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4537631)
