Euclidean Prize-Collecting Steiner Forest
- 22 January 2011
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 62 (3-4) , 906-929
Abstract
No abstract availableKeywords
All Related Versions
This publication has 24 references indexed in Scilit:
- Tighter Bounds for Graph Steiner Tree ApproximationSIAM Journal on Discrete Mathematics, 2005
- Sparsest cuts and concurrent flows in product graphsDiscrete Applied Mathematics, 2004
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxationJournal of the ACM, 2001
- Embedding Tree Metrics into Low-Dimensional Euclidean SpacesDiscrete & Computational Geometry, 2000
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithmsJournal of the ACM, 1999
- A Constant-Factor Approximation Algorithm for thek-MST ProblemJournal of Computer and System Sciences, 1999
- Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related ProblemsSIAM Journal on Computing, 1999
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problemsJournal of the ACM, 1998
- The prize collecting traveling salesman problemNetworks, 1989
- The Steiner problem with edge lengths 1 and 2Information Processing Letters, 1989