Sciweavers

Share
15 search results - page 1 / 3
» A Polynomial-Time Approximation Scheme for Euclidean Steiner...
Sort
View
FOCS
2008
IEEE
10 years 9 months ago
A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest
We give a randomized O(n polylog n)-time approximation scheme for the Steiner forest problem in the Euclidean plane. For every fixed ǫ > 0 and given n terminals in the plane ...
Glencora Borradaile, Philip N. Klein, Claire Mathi...
LATIN
2010
Springer
10 years 7 months ago
Euclidean Prize-Collecting Steiner Forest
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 Euc...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi
STOC
2010
ACM
295views Algorithms» more  STOC 2010»
10 years 7 months ago
Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi a...
SODA
1998
ACM
128views Algorithms» more  SODA 1998»
10 years 4 months ago
A Polynomial-Time Approximation Scheme for Weighted Planar Graph TSP
Given a planar graph on n nodes with costs weights on its edges, de ne the distance between nodes i and j as the length of the shortest path between i and j. Consider this as an i...
Sanjeev Arora, Michelangelo Grigni, David R. Karge...
APPROX
2005
Springer
131views Algorithms» more  APPROX 2005»
10 years 8 months ago
Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems
Abstract. In this paper we introduce a new technique for approximation schemes for geometrical optimization problems. As an example problem, we consider the following variant of th...
Jan Remy, Angelika Steger
books