The steiner problem with edge lengths 1 and 2,
Information Processing Letters
A note on the prize collecting traveling salesman problem
Mathematical Programming: Series A and B
A General Approximation Technique for Constrained Forest Problems
SIAM Journal on Computing
Spanning Trees---Short or Small
SIAM Journal on Discrete Mathematics
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Journal of the ACM (JACM)
A constant-factor approximation algorithm for the k-MST problem
Journal of Computer and System Sciences
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
The prize collecting Steiner tree problem: theory and practice
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Improved bounds for the unsplittable flow problem
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating the Single-Sink Link-Installation Problem in Network Design
SIAM Journal on Optimization
Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
Sparsest cuts and concurrent flows in product graphs
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Edge-Disjoint Paths in Planar Graphs
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Multicommodity flow, well-linked terminals, and routing problems
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Saving an epsilon: a 2-approximation for the k-MST problem in graphs
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Tighter Bounds for Graph Steiner Tree Approximation
SIAM Journal on Discrete Mathematics
The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Approximation algorithms for prize collecting forest problems with submodular penalty functions
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Assignment problem in content distribution networks: unsplittable hard-capacitated facility location
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Prize-collecting steiner networks via iterative rounding
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Product Multicommodity Flow in Wireless Networks
IEEE Transactions on Information Theory
Prize-collecting Steiner problems on planar graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |
In this paper, we consider Steiner forest and its generalizations, prize-collecting Steiner forest and k-Steiner forest, when the vertices of the input graph are points in the Euclidean plane and the lengths are Euclidean distances. First, we present a simpler analysis of the polynomial-time approximation scheme (PTAS) of Borradaile et al. [11] for the Euclidean Steiner forest problem. This is done by proving a new structural property and modifying the dynamic programming by adding a new piece of information to each dynamic programming state. Next we develop a PTAS for a well-motivated case, i.e., the multiplicative case, of prize-collecting and budgeted Steiner forest. The ideas used in the algorithm may have applications in design of a broad class of bicriteria PTASs. At the end, we demonstrate why PTASs for these problems can be hard in the general Euclidean case (and thus for PTASs we cannot go beyond the multiplicative case).