52 search results - page 2 / 11 » Testing Euclidean minimum spanning trees in the plane |
COMPGEOM
2003
ACM
13 years 11 months ago
2003
ACM
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
STACS
2007
Springer
14 years 14 days ago
2007
Springer
An orthogonal spanner network for a given set of n points in the plane is a plane straight line graph with axis-aligned edges that connects all input points. We show that for any ...
GECCO
2005
Springer
13 years 11 months ago
2005
Springer
Among the many codings of spanning trees for evolutionary search are those based on bijections between Pr¨ufer strings—strings of n−2 vertex labels—and spanning trees on th...
JUCS
2007
13 years 6 months ago
2007
: We give a tight analysis of an old and popular sweep-line heuristic for constructing a spanning tree of a set of n points in the plane. The algorithm sweeps a vertical line acros...
EUROCAST
2009
Springer
14 years 28 days ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...