Elementary approximation algorithms for prize collecting Steiner tree problems
From MaRDI portal
Recommendations
- Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
- A primal-dual algorithm for the generalized prize-collecting Steiner forest problem
- Primal-dual approximation algorithms for the prize-collecting Steiner tree problem
- Improved approximation algorithms for prize-collecting Steiner tree and TSP
- scientific article; zbMATH DE number 1445375
Cites work
- Q4952698 scientific article; zbMATH DE number 1445375 (Why is no real title available?)
- A General Approximation Technique for Constrained Forest Problems A General Approximation Technique for Constrained Forest Problems
- A group-strategyproof mechanism for Steiner forests A group-strategyproof mechanism for Steiner forests
- A note on the prize collecting traveling salesman problem A note on the prize collecting traveling salesman problem
- A unified approach to approximating resource allocation and scheduling A unified approach to approximating resource allocation and scheduling
- An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem
- Approximation algorithms for prize collecting forest problems with submodular penalty functions Approximation algorithms for prize collecting forest problems with submodular penalty functions
- Network design for information networks Network design for information networks
- On the Equivalence between the Primal-Dual Schema and the Local Ratio Technique On the Equivalence between the Primal-Dual Schema and the Local Ratio Technique
- One for the price of two: a unified approach for approximating covering problems One for the price of two: a unified approach for approximating covering problems
- The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema
- When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
Cited in
(20)- On the integrality gap of the prize-collecting Steiner forest LP
- A 4-approximation algorithm for \(k\)-prize collecting Steiner tree problems
- Improved approximation algorithms for prize-collecting Steiner tree and TSP
- A General Approximation Technique for Constrained Forest Problems
- Euclidean prize-collecting Steiner forest
- Primal-dual approximation algorithms for the prize-collecting Steiner tree problem
- An approximation algorithm for the generalized prize-collecting Steiner forest problem with submodular penalties
- Variations of the prize‐collecting Steiner tree problem
- scientific article; zbMATH DE number 1445375 (Why is no real title available?)
- A primal-dual approximation algorithm for the Steiner forest problem
- A 5-approximation algorithm for the \(k\)-prize-collecting Steiner tree problem
- A primal-dual algorithm for the generalized prize-collecting Steiner forest problem
- A 2-approximation for the \(k\)-prize-collecting Steiner tree problem
- Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
- Prize-collecting Steiner network problems
- A local-search algorithm for Steiner forest
- Approximation algorithms for group prize-collecting and location-routing problems
- Approximation algorithms for prize collecting forest problems with submodular penalty functions
- Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree
- An approximation algorithm for the group prize-collecting Steiner tree problem with submodular penalties
This page was built for publication: Elementary approximation algorithms for prize collecting Steiner tree problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q963393)
