𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Cut and patch Steiner trees for ladders

✍ Scribed by Rainer E. Burkard; Tibor Dudás; Thomas Maier

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
307 KB
Volume
161
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cost allocation for steiner trees
Cost allocation for steiner trees
✍ N. Megiddo 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 280 KB

## Abstract A set of points, called consumers, and another point called central supplier, are located in a Euclidean plane. The cost of constructing a connection between two points is proportional to the distance between them. The minimum cost required for connecting all the consumers to the suppli

A branch and cut algorithm for the Stein
A branch and cut algorithm for the Steiner problem in graphs
✍ Lucena, A.; Beasley, J. E. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 165 KB 👁 2 views

In this paper, we consider the Steiner problem in graphs, which is the problem of connecting together, at minimum cost, a number of vertices in an undirected graph with nonnegative edge costs. We use the formulation of this problem as a shortest spanning tree (SST) problem with additional constraint

Faster exact algorithms for steiner tree
Faster exact algorithms for steiner trees in planar networks
✍ Marshall Bern 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 739 KB

We improve the time and space complexities of dynamic programming algorithms that compute optimal Steiner trees spanning nodes in planar networks. Our algorithms have special application to the rectilinear Steiner problem.