𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A partition-based relaxation for Steiner trees

✍ Scribed by Jochen Könemann; David Pritchard; Kunlun Tan

Book ID
106275904
Publisher
Springer-Verlag
Year
2009
Tongue
English
Weight
407 KB
Volume
127
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hypergraphic LP Relaxations for Steiner
Hypergraphic LP Relaxations for Steiner Trees
✍ Chakrabarty, Deeparnab; Könemann, Jochen; Pritchard, David 📂 Article 📅 2013 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 418 KB
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