𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The node-weighted steiner tree problem

✍ Scribed by Arie Segev

Publisher
John Wiley and Sons
Year
1987
Tongue
English
Weight
745 KB
Volume
17
Category
Article
ISSN
0028-3045

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

The Steiner tree problem
The Steiner tree problem
✍ Dirk van Oudheusden πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 87 KB
The 1-steiner tree problem
The 1-steiner tree problem
✍ George Georgakopoulos; Christos H Papadimitriou πŸ“‚ Article πŸ“… 1987 πŸ› Elsevier Science 🌐 English βš– 480 KB
On the terminal Steiner tree problem
On the terminal Steiner tree problem
✍ Guohui Lin; Guoliang Xue πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 69 KB

We investigate a practical variant of the well-known graph Steiner tree problem. In this variant, every target vertex is required to be a leaf vertex in the solution Steiner tree. We present hardness results for this variant as well as a polynomial time approximation algorithm with performance ratio