Publication View

Let # (2007)

Abstract
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 Euclidean plane. It is known that #2 = 2 and #5 = 1. In STOC'94, Khuller, Raghavachari, and Young established the following inequalities: 1.103 #3

Publication details
Download http://citeseerx.ist.psu.edu/viewdoc/summary?doi=?doi=10.1.1.12.5427
Source http://www.cs.uwaterloo.ca/~tmchan/deg_scg.ps.gz
Contributors CiteSeerX
Repository CiteSeerX - Scientific Literature Digital Library and Search Engine (United States)
Keywords discrete geometry, approximation
Type text
Language English
Relation 10.1.1.23.6765, 10.1.1.44.1065, 10.1.1.41.4418, 10.1.1.49.5440, 10.1.1.122.337, 10.1.1.21.6781, 10.1.1.21.3779, 10.1.1.33.3911