Sciweavers

626 search results - page 8 / 126
» On Approximability of Minimum Bisection Problem
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
ALGORITHMICA
2011
12 years 11 months ago
Approximating Minimum-Power Degree and Connectivity Problems
Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov, Elena...