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

AnO(logk)-approximation algorithm for thekminimum spanning tree problem in the plane

โœ Scribed by N. Garg; D. S. Hochbaum

Book ID
110547543
Publisher
Springer
Year
1997
Tongue
English
Weight
505 KB
Volume
18
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

An approximation scheme for some Steiner
An approximation scheme for some Steiner tree problems in the plane
โœ Wang, Lusheng; Jiang, Tao ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 536 KB

We design a polynomial-time approximation scheme for the Steiner tree problem in the plane when the given set of regular points is c-local, i.e., in the minimum-cost spanning tree for the given set of regular points, the length of the longest edge is at most c times the length of the shortest edge.