Faster algorithms for MAX CUT and MAX CSP, with polynomial expected time for sparse instances

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2764, Issue , 2003, Pages 382-395

  Scott, Alexander D ^a   Sorkin, Gregory B ^b  

^a UNIVERSITY COLLEGE LONDON   (United Kingdom)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; CONSTRAINT SATISFACTION PROBLEMS; GRAPH THEORY; OPTIMIZATION; POLYNOMIALS;

BINARY VARIABLES; DETERMINISTIC ALGORITHMS; EDGE DENSITIES; EXPECTED TIME; MAXIMUM CONSTRAINT SATISFACTION PROBLEMS; RANDOM INSTANCE; SOLUTION TIME; UNDERLYING GRAPHS;

APPROXIMATION ALGORITHMS;

EID: 33244459054     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45198-3_32     Document Type: Article

References (13)

1. Béla Bollobás, Christian Borgs, Jennifer T. Chayes, Jeong Han Kim, and David B. Wilson, The scaling window of the 2-SAT transition, Random Structures Algorithms 18 (2001), no. 3, 201-256.
2. Béla Bollobás, Random graphs, Cambridge Studies in Advanced Mathematics, vol. 73, Cambridge University Press, Cambridge, 2001.
3. Don Coppersmith, David Gamarnik, Mohammad Hajiaghayi, and Gregory B. Sorkin, Random MAX SAT, random MAX CUT, and their phase transitions, Submitted for publication. 49 pages.
4. Don Coppersmith, David Gamarnik, Mohammad Hajiaghayi, and Gregory B. Sorkin, Random MAX SAT, random MAX CUT, and their phase transitions, Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (Baltimore, MD, 2003), ACM, New York, 2003.
5. Amin Coja-Oghlan, C. Moore, and V. Sanwalani, Max k-cut and approximating the chromatic number of random graphs, To appear.
6. Vasēk Chvátal and Bruce Reed, Mick gets some (the odds are on his side), 33th Annual Symposium on Foundations of Computer Science (Pittsburgh, PA, 1992), IEEE Comput. Soc. Press, Los Alamitos, CA, 1992, pp. 620-627.
7. Wenceslas Fernandez de la Vega, On random 2-SAT, Manuscript, 1992.
8. Jens Gramm, Edward A. Hirsch, Rolf Niedermeier, and Peter Rossmanith, New worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT, Discrete Applied Mathematics, In Press.
9. Andreas Goerdt, A threshold for unsatisfiability, J. Comput. System Sci. 53 (1996), no. 3, 469-486.
10. |E|/4, Zap. Nauchn. Sem. S.-Peterburg. Otdel. Mat. Inst. Steklov. (POMI) 293 (2002), no. Teor. Slozhn. Vychisl. 7, 129-138, 183.
11. Michael Krivelevich and Van H. Vu, Approximating the independence number and the chromatic number in expected polynomial time, J. Comb. Optim. 6 (2002), no. 2, 143-155.
12. Anusch Taraz and Amin Coja-Oghlan, Colouring random graphs in expected polynomial time, Proceedings of STACS 2003, LNCS 2607, 2003, pp. 487-498.
13. Luca Trevisan, Gregory B. Sorkin, Madhu Sudan, and David P. Williamson, Gadgets, approximation, and linear programming, SIAM J. Comput. 29 (2000), no. 6, 2074-2097.