✦ LIBER ✦

Convexity and the Steiner tree problem

✍ Scribed by J. Scott Provan

Publisher: John Wiley and Sons
Year: 1988
Tongue: English
Weight: 968 KB
Volume: 18
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230180108

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Steiner tree problem

✍ Dirk van Oudheusden 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 87 KB

The 1-steiner tree problem

✍ George Georgakopoulos; Christos H Papadimitriou 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 480 KB

The node-weighted steiner tree problem

✍ Arie Segev 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 745 KB

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

The General Steiner Tree-Star problem

✍ Samir Khuller; An Zhu 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 78 KB

The Steiner tree problem is defined as follows-given a graph G = (V , E) and a subset X ⊂ V of terminals, compute a minimum cost tree that includes all nodes in X. Furthermore, it is reasonable to assume that the edge costs form a metric. This problem is NP-hard and has been the study of many heuris

A constrained Steiner tree problem

✍ Moshe B. Rosenwein; Richard T. Wong 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 645 KB