Yet another algorithm for dense Max Cut: Go greedy

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 176-182

  Mathieu, Claire ^a   Schudy, Warren ^b  

^a Brown Univerity   (United States)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION SCHEMES; CONSTRAINT SATISFACTION PROBLEM (CSP);

ALGORITHMS;

APPROXIMATION ALGORITHMS;

EID: 58449129154     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)

1. Noga Alon, W. Fernandez de la Vega, Ravi Kannan, and Marek Karpinski. Random sampling and approximation of MAX-CSPs. J. Comput. Syst. Sci., 67(2):212-243, 2003.
2. Noga Alon, Eldar Fischer, Ilan Newman, and Asaf Shapira. A combinatorial characterization of the testable graph properties: It's all about regularity. In STOC '06: Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, pages 251-260, New York, NY, USA, 2006. ACM Press.
3. Sanjeev Arora, David Karger, and Marek Karpinski. Polynomial time approximation schemes for dense instances of NP-hard problems. In STOC '95: Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, pages 284-293. 1995.
4. W. Fernandez de la Vega. MAX-CUT has a randomized approximation scheme in dense graphs. Random Struct. Algorithms, 8(3):187-198, 1996.
5. Alan M. Frieze and Ravi Kannan. Quick approximation to matrices and applications. Combinatorica, 19(2): 175-220, 1999.
6. Oded Goldreich, Shari Goldwasser, and Dana Ron. Property testing and its connection to learning and approximation. J. ACM, 45(4):653-750, 1998.