Sciweavers

Share
APPROX
2005
Springer

Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems

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 the geometric Steiner tree problem. Every point u which is not included in the tree costs a penalty of π(u) units. Furthermore, every Steiner point that we use costs cS units. The goal is to minimize the total length of the tree plus the penalties. Our technique yields a polynomial time approximation scheme for the problem, if the points lie in the plane.
Jan Remy, Angelika Steger
Added 26 Jun 2010
Updated 26 Jun 2010
Type Conference
Year 2005
Where APPROX
Authors Jan Remy, Angelika Steger
Comments (0)
books