- Record: found
- Abstract: not found
- Book Chapter: not found
Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
Faster Algorithms for MAX CUT and MAX CSP, with Polynomial Expected Time for Sparse Instances
other
Read this book at
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Most cited references7
- Record: found
- Abstract: not found
- Article: not found
A Threshold for Unsatisfiability
Andreas Goerdt (1996)
