✦ LIBER ✦

A note on lower bounds for rectilinear Steiner trees

✍ Scribed by J.S. Salowe

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 98 KB
Volume: 42
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(92)90139-m

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

Lower bounds for rectilinear Steiner tre

Lower bounds for rectilinear Steiner trees: Information processing letters vol. 37, no. 2 (31 January 1991) pp. 71–74

✍ Timothy Law Snyder 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 49 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

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 note on Steiner tree games

✍ Darko Skorin-Kapov; Jadranka Skorin-Kapov 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 202 KB