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

Local Optimization in the Steiner Problem on the Euclidean Plane

โœ Scribed by D. T. Lotarev; A. V. Suprun; A. P. Uzdemir


Book ID
111572430
Publisher
SP MAIK Nauka/Interperiodica
Year
2004
Tongue
English
Weight
161 KB
Volume
65
Category
Article
ISSN
0005-1179

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


The local Steiner problem in normed plan
โœ Konrad J. Swanepoel ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 174 KB ๐Ÿ‘ 2 views
An approximation algorithm for a bottlen
โœ 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