𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems

✍ Scribed by Jan Remy; Angelika Steger

Publisher
Springer
Year
2007
Tongue
English
Weight
654 KB
Volume
55
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A strong lower bound for the Node Weight
A strong lower bound for the Node Weighted Steiner Tree Problem
✍ Engevall, Stefan; GοΏ½the-Lundgren, Maud; VοΏ½rbrand, Peter πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 84 KB πŸ‘ 1 views

In this paper, we study the Node Weighted Steiner Tree Problem (NSP). This problem is a generalization of the Steiner tree problem in the sense that vertex weights are considered. Given an undirected graph, the problem is to find a tree that spans a subset of the vertices and is such that the total

An approximation scheme for some Steiner
An approximation scheme for some Steiner tree problems in the plane
✍ Wang, Lusheng; Jiang, Tao πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 536 KB

We design a polynomial-time approximation scheme for the Steiner tree problem in the plane when the given set of regular points is c-local, i.e., in the minimum-cost spanning tree for the given set of regular points, the length of the longest edge is at most c times the length of the shortest edge.