๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An improved algorithm for computing Steiner minimal trees in Euclidean -space

โœ Scribed by Marcia Fampa; Kurt M. Anstreicher

Book ID
108114368
Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
463 KB
Volume
5
Category
Article
ISSN
1572-5286

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Euclidean Steiner minimum trees: An impr
Euclidean Steiner minimum trees: An improved exact algorithm
โœ Winter, Pawel; Zachariasen, Martin ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 296 KB

The Euclidean Steiner tree problem asks for a shortest network interconnecting a set of terminals in the plane. Over the last decade, the maximum problem size solvable within 1 h (for randomly generated problem instances) has increased from 10 to approximately 50 terminals. We present a new exact al

An approximation algorithm for a bottlen
An approximation algorithm for a bottleneck k-Steiner tree problem in the Euclidean plane
โœ Lusheng Wang; Zimao Li ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 95 KB

We study a bottleneck Steiner tree problem: given a set P = {p 1 , p 2 , . . . , p n } of n terminals in the Euclidean plane and a positive integer k, find a Steiner tree with at most k Steiner points such that the length of the longest edges in the tree is minimized. The problem has applications in