Sciweavers

642 search results - page 3 / 129
» Approximation Algorithms for Minimum K-Cut
Sort
View
STOC
1994
ACM
97views Algorithms» more  STOC 1994»
14 years 1 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
SIAMCOMP
2008
60views more  SIAMCOMP 2008»
13 years 9 months ago
Improved Approximation Algorithms for Minimum Weight Vertex Separators
Uriel Feige, MohammadTaghi Hajiaghayi, James R. Le...
ALGORITHMICA
2000
77views more  ALGORITHMICA 2000»
13 years 9 months ago
Approximation Algorithms for Minimum K-Cut
Nili Guttmann-Beck, Refael Hassin