✦ LIBER ✦

A Lower Bound for the Steiner Tree Problem

✍ Scribed by Chung, F. R. K.; Hwang, F. K.

Book ID: 118194597
Publisher: Society for Industrial and Applied Mathematics
Year: 1978
Tongue: English
Weight: 476 KB
Volume: 34
Category: Article
ISSN: 0036-1399
DOI: 10.1137/0134003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A lower bound for the steiner tree probl

A lower bound for the steiner tree problem in directed graphs

✍ Weiguo Liu 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 593 KB

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 class Steiner minimal tree problem:

The class Steiner minimal tree problem: a lower bound and test problem generation

✍ Boting Yang; Paul Gillard 📂 Article 📅 2000 🏛 Springer-Verlag 🌐 English ⚖ 131 KB

Lower bounds for rectilinear Steiner tre

Lower bounds for rectilinear Steiner trees in bounded space

✍ Timothy Law Snyder 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 438 KB

A note on lower bounds for rectilinear S

A note on lower bounds for rectilinear Steiner trees

✍ J.S. Salowe 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 98 KB

Lower bounds for the relative greedy alg

Lower bounds for the relative greedy algorithm for approximating Steiner trees

✍ Stefan Hougardy; Stefan Kirchner 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 125 KB