3874 search results - page 75 / 775 » Approximation Algorithms for k-hurdle Problems |
SODA
2001
ACM
14 years 11 months ago
2001
ACM
We give an implementation of the Goemans-Williamson clustering procedure which is at the core of several approximation algorithms including those for Generalized Steiner Trees, Pr...
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
Several inverse problems exist in the atmospheric sciences that are computationally costly when using traditional gradient based methods. Unfortunately, many standard evolutionary ...
WAOA
2005
Springer
15 years 3 months ago
2005
Springer
MAX SAT and MAX NAE-SAT are central problems in theoretical computer science. We present an approximation algorithm for MAX NAE-SAT with a conjectured performance guarantee of 0.82...
104
click to vote
FOCS
1998
IEEE
15 years 2 months ago
1998
IEEE
This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other fractional packing problems. We provide a different ap...
ESA
2001
Springer
15 years 2 months ago
2001
Springer
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...