Login / Signup
Faster Algorithms for MAX CUT and MAX CSP, with Polynomial Expected Time for Sparse Instances.
Alex D. Scott
Gregory B. Sorkin
Published in:
RANDOM-APPROX (2003)
Keyphrases
</>
max cut
np complete problems
orders of magnitude
optimization problems
combinatorial optimization
benchmark problems
hard problems
max csp