✦ LIBER ✦

Concatenation-Based Greedy Heuristics for the Euclidean Steiner Tree Problem

✍ Scribed by M. Zachariasen; P. Winter

Publisher: Springer
Year: 1999
Tongue: English
Weight: 260 KB
Volume: 25
Category: Article
ISSN: 0178-4617
DOI: 10.1007/pl00009287

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A delaunay triangulation-based heuristic

A delaunay triangulation-based heuristic for the euclidean steiner problem

✍ J. E. Beasley; F. Goffinet 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 663 KB

Greedy heuristics for the diameter-const

Greedy heuristics for the diameter-constrained minimum spanning tree problem

✍ C. Requejo; E. Santos 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 385 KB

An O(n log n) heuristic for steiner mini

An O(n log n) heuristic for steiner minimal tree problems on the euclidean metric

✍ J. Macgregor Smith; D. T. Lee; Judith S. Liebman 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 789 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

Approximation algorithm for bottleneck S

Approximation algorithm for bottleneck Steiner tree problem in the Euclidean plane

✍ Zi-Mao Li; Da-Ming Zhu; Shao-Han Ma 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 339 KB

An average case analysis of a greedy alg

An average case analysis of a greedy algorithm for the on-line Steiner tree problem

✍ Ying Teh Tsai; Chuan Yi Tang; Yunn Yen Chen 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 719 KB