93 search results - page 5 / 19 » Sublinear-time approximation of Euclidean minimum spanning t... |
ALGORITHMICA
2004
14 years 9 months ago
2004
We consider the problem of finding a minimum diameter spanning tree with maximum node degree B in a complete undirected edge-weighted graph. We provide an O( p logB n)-approximatio...
111
click to vote
STOC
2007
ACM
15 years 10 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
COMPGEOM
2000
ACM
15 years 2 months ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
STOC
2000
ACM
15 years 2 months ago
2000
ACM
STOC
1994
ACM
15 years 2 months ago
1994
ACM
Givenn points in the Euclideanplane,we considerthe problemof findingthe minimumtree spanninganyk points.The problemis NP-hardand we givean O(logk)-approximationalgorithm. Key Words...