𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Steiner tree problem I: Formulations, compositions and extension of facets

✍ Scribed by Sunil Chopra; M. R. Rao

Publisher
Springer-Verlag
Year
1994
Tongue
English
Weight
1002 KB
Volume
64
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Variations of the prize-collecting Stein
Variations of the prize-collecting Steiner tree problem
✍ Olena Chapovska; Abraham P. Punnen πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 136 KB

## Abstract The prize‐collecting Steiner tree problem is well known to be NP‐hard. We consider seven variations of this problem generalizing several well‐studied bottleneck and minsum problems with feasible solutions as trees of a graph. Four of these problems are shown to be solvable in __O__(__m_

Experimental evaluation of a partitionin
Experimental evaluation of a partitioning algorithm for the steiner tree problem in R2 and R3
✍ Sivakumar Ravada; Alan T. Sherman πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 614 KB

## Abstract We experimentally evaluate sequential and distributed implementations of an approximation partitioning algorithm by Kalpakis and Sherman for the __Geometric Steiner Minimum Tree Problem (GSMT)__ in __R^d^__ for __d__ = 2,3. Our implementations incorporate an improved method for combinin