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

• Type: Conference
• Year: 2003
• Where: COMPGEOM
• Authors: Timothy M. Chan
• Keywords: COMPGEOM 2003, Degree-K Spanning Tree, Minimum Spanning Tree, Spanning Tree