✦ LIBER ✦

Two Heuristics for the Euclidean Steiner Tree Problem

✍ Scribed by Derek R. Dreyer; Michael L. Overton

Book ID: 110261303
Publisher: Springer US
Year: 1998
Tongue: English
Weight: 368 KB
Volume: 13
Category: Article
ISSN: 0925-5001
DOI: 10.1023/a:1008285504599

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Concatenation-Based Greedy Heuristics fo

Concatenation-Based Greedy Heuristics for the Euclidean Steiner Tree Problem

✍ M. Zachariasen; P. Winter 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 260 KB

Efficient Heuristics for Orientation Met

Efficient Heuristics for Orientation Metric and Euclidean Steiner Tree Problems

✍ Y.Y. Li; K.S. Leung; C.K. Wong 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 138 KB

A heuristic for Euclidean and rectilinea

A heuristic for Euclidean and rectilinear Steiner problems

✍ J.E. Beasley 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 553 KB

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

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