Approximating almost all instances of MAX-CUT within a ratio above the håstad threshold

Authors:
A. C. Kaporis;L. M. Kirousis;E. C. Stavropoulos
Affiliations:
University of Patras, Department of Computer Engineering and Informatics, GR, Patras, Greece;University of Patras, Department of Computer Engineering and Informatics, GR, Patras, Greece and Research Academic Computer Technology Institute,GR, Patras, Greece;University of Patras, Department of Computer Engineering and Informatics, GR, Patras, Greece
Venue:
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Year:
2006

Citing 14
Cited 2

An application of combinatorial optimization to statistical physics and circuit layout design

Operations Research
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
Algorithmic theory of random graphs

Random Structures & Algorithms - Special issue: average-case analysis of algorithms
Gadgets, Approximation, and Linear Programming

SIAM Journal on Computing
Some optimal inapproximability results

Journal of the ACM (JACM)
Packing Edges in Random Regular Graphs

MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
An Upper Bound for the Maximum Cut Mean Value

WG '97 Proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science
Hardness of Approximating the Shortest Vector Problem in Lattices

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Random MAX SAT, random MAX CUT, and their phase transitions

Random Structures & Algorithms - Isaac Newton Institute Programme “Computation, Combinatorics and Probability”: Part II
Large k-separated matchings of random regular graphs

ACSC '05 Proceedings of the Twenty-eighth Australasian conference on Computer Science - Volume 38
Near-optimal algorithms for unique games

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Max k-cut and approximating the chromatic number of random graphs

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Approximation algorithm for random MAX-kSAT

SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
5-regular graphs are 3-colorable with positive probability

ESA'05 Proceedings of the 13th annual European conference on Algorithms

Approximability Distance in the Space of H-Colourability Problems

CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Approximating maximum cut with limited unbalance

WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a deterministic polynomial-time algorithm which for any given average degree d and asymptotically almost all random graphs G in G(n, m = [d/2 n]) outputs a cut of G whose ratio (in cardinality) with the maximum cut is at least 0.952. We remind the reader that it is known that unless P=NP, for no constant ε0 is there a Max-Cut approximation algorithm that for all inputs achieves an approximation ratio of (16/17) +ε (16/17