Euclidean prize-collecting Steiner forest
From MaRDI portal
Publication:2429324
DOI10.1007/S00453-011-9491-8zbMATH Open1241.68086OpenAlexW2096477872MaRDI QIDQ2429324FDOQ2429324
Recommendations
- Euclidean Prize-Collecting Steiner Forest
- A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest
- scientific article; zbMATH DE number 6783450
- Elementary approximation algorithms for prize collecting Steiner tree problems
- Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
Cites Work
- scientific article; zbMATH DE number 6381762 (Why is no real title available?)
- scientific article; zbMATH DE number 1757947 (Why is no real title available?)
- scientific article; zbMATH DE number 2119660 (Why is no real title available?)
- scientific article; zbMATH DE number 1445375 (Why is no real title available?)
- A General Approximation Technique for Constrained Forest Problems
- A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest
- A constant-factor approximation algorithm for the \(k\)-MST problem
- A note on the prize collecting traveling salesman problem
- Approximating the single-sink link-installation problem in network design
- Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Approximation algorithms for prize collecting forest problems with submodular penalty functions
- Approximation schemes for Steiner forest on planar graphs and graphs of bounded treewidth
- Assignment problem in content distribution networks, unsplittable hard-capacitated facility location
- Detecting high log-densities, an \(O(n^{1/4})\) approximation for densest \(k\)-subgraph
- Dial a Ride from k-Forest
- Edge-disjoint paths in planar graphs with constant congestion
- Embedding tree metrics into low-dimensional Euclidean spaces
- Euclidean Prize-Collecting Steiner Forest
- Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
- Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP
- Multicommodity flow, well-linked terminals, and routing problems
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Prize-collecting Steiner networks via iterative rounding
- Product Multicommodity Flow in Wireless Networks
- Saving an epsilon: a 2-approximation for the \(k\)-MST problem in graphs
- Spanning Trees—Short or Small
- Sparsest cuts and concurrent flows in product graphs.
- The Steiner problem with edge lengths 1 and 2
- The prize collecting traveling salesman problem
- The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema
- Tighter Bounds for Graph Steiner Tree Approximation
Cited In (9)
- Streaming algorithms for geometric Steiner forest
- Approximation schemes for Steiner forest on planar graphs and graphs of bounded treewidth
- Euclidean Prize-Collecting Steiner Forest
- A PTAS for the Steiner forest problem in doubling metrics
- Colored Non-crossing Euclidean Steiner Forest
- Exact algorithms for budgeted prize-collecting covering subgraph problems
- A unified PTAS for prize collecting TSP and Steiner tree problem in doubling metrics
- A PTAS for the geometric connected facility location problem
- A unified PTAS for prize collecting TSP and Steiner tree problem in doubling metrics
This page was built for publication: Euclidean prize-collecting Steiner forest
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2429324)
