✦ LIBER ✦

On-line steiner trees in the Euclidean plane

✍ Scribed by Noga Alon; Yossi Azar

Book ID: 110560947
Publisher: Springer
Year: 1993
Tongue: English
Weight: 485 KB
Volume: 10
Category: Article
ISSN: 0179-5376
DOI: 10.1007/bf02573969

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Bottleneck Steiner trees in the plane

✍ Sarrafzadeh, M.; Wong, C.K. 📂 Article 📅 1992 🏛 IEEE 🌐 English ⚖ 532 KB

A decomposition theorem on Euclidean Ste

A decomposition theorem on Euclidean Steiner minimal trees

✍ F. K. Hwang; G. D. Song; G. Y. Ting; D. Z. Du 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 623 KB

Local Optimization in the Steiner Proble

Local Optimization in the Steiner Problem on the Euclidean Plane

✍ D. T. Lotarev; A. V. Suprun; A. P. Uzdemir 📂 Article 📅 2004 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 161 KB

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

Conversion of the Steiner Problem on the

Conversion of the Steiner Problem on the Euclidean Plane to the Steiner Problem on Graph

✍ D. T. Lotarev; A. P. Uzdemir 📂 Article 📅 2005 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 158 KB