Sciweavers

626 search results - page 8 / 126
» On Approximability of Minimum Bisection Problem
Sort
View
115
Voted
STOC
1994
ACM
97views Algorithms» more  STOC 1994»
15 years 6 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
90
Voted
STOC
1989
ACM
66views Algorithms» more  STOC 1989»
15 years 6 months ago
The Minimum Consistent DFA Problem Cannot Be Approximated within any Polynomial
Leonard Pitt, Manfred K. Warmuth
124
Voted
COMGEO
2006
ACM
15 years 2 months ago
The minimum Manhattan network problem: Approximations and exact solutions
Marc Benkert, Alexander Wolff, Florian Widmann, Ta...
139
Voted
ALGORITHMICA
2011
14 years 6 months ago
Approximating Minimum-Power Degree and Connectivity Problems
Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov, Elena...