Sciweavers

STOC
1994
ACM

An O(log k) approximation algorithm for the k minimum spanning tree problem in the plane

14 years 4 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. Grids,Travelingsalesmanproblem.
Naveen Garg, Dorit S. Hochbaum
Added 10 Aug 2010
Updated 10 Aug 2010
Type Conference
Year 1994
Where STOC
Authors Naveen Garg, Dorit S. Hochbaum
Comments (0)