𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Algorithms for terminal Steiner trees

✍ Scribed by Fábio Viduani Martinez; José Coelho de Pina; José Soares

Book ID
108281355
Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
499 KB
Volume
389
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A polynomial time algorithm for rectilin
A polynomial time algorithm for rectilinear Steiner trees with terminals constrained to curves
✍ Brazil, M.; Thomas, D. A.; Weng, J. F. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 168 KB 👁 2 views

The rectilinear Steiner problem is the problem of constructing the shortest rectilinear network in the plane connecting a given set of points, called terminals. The problem is known to be NP-complete in general. In this paper, we show that there is a polynomial time algorithm for solving the rectili

A fast algorithm for Steiner trees
A fast algorithm for Steiner trees
✍ L. Kou; G. Markowsky; L. Berman 📂 Article 📅 1981 🏛 Springer-Verlag 🌐 English ⚖ 248 KB

Given an undirected distance graph G = (V, E, d) and a set S, where V is the set of vertices in G, E is the set of edges in G, d is a distance function which maps E into the set of nonnegative numbers and S___ V is a subset of the vertices of V, the Steiner tree problem is to find a tree of G that s