Sciweavers

841 search results - page 9 / 169
» Approximability of Minimum AND-Circuits
Sort
View
STOC
1994
ACM
97views Algorithms» more  STOC 1994»
13 years 11 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
SODA
2003
ACM
94views Algorithms» more  SODA 2003»
13 years 9 months ago
Sublinear-time approximation of Euclidean minimum spanning tree
Artur Czumaj, Funda Ergün, Lance Fortnow, Avn...