Euclidean bounded-degree spanning tree ratios

13 years 9 months ago

Download www.cs.uwaterloo.ca

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 ﬁnite point sets in the Eu

Timothy M. Chan

Real-time Traffic

COMPGEOM 2003 | Degree-K Spanning Tree | Minimum Spanning Tree | Spanning Tree |

claim paper

» Analysis of two Sweepline Algorithms for Constructing Spanning Trees and Steiner Trees

» Symmetric range assignment with disjoint MST constraints

» Approximation Algorithms for the Bottleneck Stretch Factor Problem

» Optimal Node Density for Detection in EnergyConstrained Random Networks

» Spanners for Geometric Intersection Graphs

Post Info
More Details (n/a)

Added	05 Jul 2010
Updated	05 Jul 2010
Type	Conference
Year	2003
Where	COMPGEOM
Authors	Timothy M. Chan

Comments (0)

Sciweavers

Euclidean bounded-degree spanning tree ratios

COMPGEOM 2003 | Degree-K Spanning Tree | Minimum Spanning Tree | Spanning Tree |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers