Sciweavers

Share
COMPGEOM
2003
ACM

Euclidean bounded-degree spanning tree ratios

9 years 9 months ago
Euclidean bounded-degree spanning tree ratios
Let τK be the worst-case (supremum) ratio of the weight of the minimum degree-K spanning tree to the weight of the minimum spanning tree, over all finite point sets in the Eu
Timothy M. Chan
Added 05 Jul 2010
Updated 05 Jul 2010
Type Conference
Year 2003
Where COMPGEOM
Authors Timothy M. Chan
Comments (0)
books