Sciweavers

396 search results - page 10 / 80
» An Optimal Minimum Spanning Tree Algorithm
Sort
View
STOC
1994
ACM
97views Algorithms» more  STOC 1994»
15 years 7 months ago
An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane
Givenn points in the Euclideanplane,we considerthe problemof findingthe minimumtree spanninganyk points.The problemis NP-hardand we givean O(logk)-approximationalgorithm. Key Words...
Naveen Garg, Dorit S. Hochbaum
99
Voted
TALG
2008
80views more  TALG 2008»
15 years 2 months ago
Randomized minimum spanning tree algorithms using exponentially fewer random bits
Seth Pettie, Vijaya Ramachandran