𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On better heuristics for Steiner minimum trees

✍ Scribed by Ding-Zhu Du; Yanjun Zhang

Publisher
Springer-Verlag
Year
1992
Tongue
English
Weight
519 KB
Volume
57
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Dynamic Programming for Minimum Steiner
Dynamic Programming for Minimum Steiner Trees
✍ B. Fuchs; W. Kern; D. Molle; S. Richter; P. Rossmanith; X. Wang πŸ“‚ Article πŸ“… 2007 πŸ› Springer 🌐 English βš– 180 KB
A tabu search heuristic for the Steiner
A tabu search heuristic for the Steiner Tree Problem
✍ Gendreau, Michel; Larochelle, Jean-Francois; SansοΏ½, Brunilde πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 342 KB πŸ‘ 2 views

The Steiner Tree Problem (STP) in graphs is a well-known NP-hard problem. It has regained attention due to the introduction of new telecommunication technologies, such as ATM, since it appears as the inherent mathematical structure behind multicast communications. In this paper, we present a tabu se

Delay-related secondary objectives for r
Delay-related secondary objectives for rectilinear Steiner minimum trees
✍ Sven Peyer; Martin Zachariasen; David Grove JΓΈrgensen πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 759 KB

The rectilinear Steiner tree problem in the plane is to construct a minimum-length tree interconnecting a set of points (called terminals) consisting of horizontal and vertical line segments only. Rectilinear Steiner minimum trees (RSMTs) can today be computed quickly for realistic instances occurri