Solving sparse random instances of Max Cut and Max 2-CSP in linear expected time

Combinatorics Probability and Computing

Volumn 15, Issue 1-2, 2006, Pages 281-315

  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; CONSTRAINT THEORY; LINEAR EQUATIONS; PROBLEM SOLVING; RANDOM PROCESSES;

BINOMIAL DISTRIBUTIONS; RANDOM GRAPH; VARIABLE CONSTRAINT;

GRAPH THEORY;

EID: 29744441377     PISSN: 09635483     EISSN: 14692163     Source Type: Journal    
DOI: 10.1017/S096354830500725X     Document Type: Article

References (32)

1. Aldous, D. (1997) Brownian excursions, critical random graphs and the multiplicative coalescent. Ann. Probab. 25 812-854.
2. von Bahr, B. and Martin-Löf, A. (1980) Threshold limit theorems for some epidemic processes. Adv. Appl. Probab. 12 319-349.
3. Bender, E. A., Canfield, E. R. and McKay, B. D. (1990) The asymptotic number of labeled connected graphs with a given number of vertices and edges. Random Struct. Alg. 1 127-169.
4. Berry, A. C. (1941) The accuracy of the Gaussian approximation to the sum of independent variates. Trans. Amer. Math. Soc. 49 122-136.
5. Bollobás, B. (1984) The evolution of sparse graphs. In Graph Theory and Combinatorics (Cambridge 1983), Academic Press, London, pp. 35-57.
6. Bollobás, B. (2001) Random Graphs, Vol. 73 of Cambridge Studies in Advanced Mathematics, Cambridge University Press, Cambridge.
7. Bollobás, B., Borgs, C., Chayes, J. T., Kim, J. H. and Wilson, D. B. (2001) The scaling window of the 2-SAT transition. Random Struct. Alg. 18 201-256.
8. Chvátal, V. and Reed, B. (1992) Mick gets some (the odds are on his side). In 33th Annual Symposium on Foundations of Computer Science (Pittsburgh, PA, 1992), IEEE Comput. Soc. Press, Los Alamitos, CA, pp. 620-627.
9. Coja-Oghlan, A., Moore, C. and Sanwalani, V. Max k-cut and approximating the chromatic number of random graphs. To appear in Random Struct. Alg.
10. Coja-Oghlan, A. and Taraz, A. (2003) Colouring random graphs in expected polynomial time. In Proc. STACS 2003, Vol. 2607 of Lecture Notes in Computer Science, Springer, pp. 487-498.
11. Coppersmith, D., Gamarnik, D., Hajiaghayi, M. T. and Sorkin, G. B. (2004) Random MAX SAT, random MAX CUT, and their phase transitions. Random Struct. Alg. 24 502-545.
12. Erdos, P. and Rényi, A. (1960) On the evolution of random graphs. Magyar Tud. Akad. Mat. Kutató Int. Közl. 5 17-61.
13. Erdos, P. and Rényi, A. (1961) On the evolution of random graphs. Bull. Inst. Internat. Statist. 38 343-347.
14. Fernandez de la Vega, W. (1992) On random 2-SAT. Manuscript.
15. Gellert, W., Kästner, H., Küstner, H. and Hellwich, M., eds (1977) The VNR Concise Encyclopedia of Mathematics, Van Nostrand Reinhold Co., New York.
16. Goerdt, A. (1996) A threshold for unsatisfiability. J. Comput. System Sci. 53 469-486.
17. Gramm, J., Hirsch, E. A., Niedermeier, R. and Rossmanith, P. (2003) New worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT. Discrete Appl. Math. 130 139-155.
18. Hirsch, E. A. (2000) A new algorithm for MAX-2-SAT. In Proc. STACS 2000 (Lille), Vol. 1770 of Lecture Notes in Computer Science, Springer, Berlin, pp. 65-73.
19. Hoeffding, W. (1963) Probability inequalities for sums of bounded random variables. J. Amer. Statist. Assoc. 58 13-30.
20. Janson, S., Łuczak, T. and Ruciński, A. (2000) Random Graphs, Wiley-Interscience Series in Discrete Mathematics and Optimization, Wiley-Interscience, New York.
21. Karp, R. M. (1990) The transitive closure of a random digraph. Random Struct. Alg. 1 73-93.
22. Kendall, D. G. (1956) Deterministic and stochastic epidemics in closed populations. In Proc. Third Berkeley Symposium on Mathematical Statistics and Probability, 1954-1955, Vol. IV (Berkeley and Los Angeles), University of California Press, pp. 149-165.
23. Krivelevich, M. and Vu, V. H. (2002) Approximating the independence number and the chromatic number in expected polynomial time. J. Combin. Optim. 6 143-155.
24. |E|/4. Zap. Nauchn. Sem. S.-Peterburg. Otdel. Mat. Inst. Steklov. (POMI) 293 129-138, 183.
25. Luczak, T. (1990) On the number of sparse connected graphs. Random Struct. Alg. 1 171-173.
26. Martin-Löf, A. (1986) Symmetric sampling procedures, general epidemic processes and their threshold limit theorems. J. Appl. Probab. 23 265-282.
27. Niedermeier, R. and Rossmanith, P. (1999) New upper bounds for MaxSat. In Automata, Languages and Programming (Prague, 1999), Vol. 1644 of Lecture Notes in Computer Science, Springer, Berlin, pp. 575-584.
28. Scott, A. D. and Sorkin, G. B. (2003) Faster algorithms for MAX CUT and MAX CSP, with polynomial expected time for sparse instances. In Proc. Random 2003 (Baltimore, MD, 2003), Springer, pp. 382-395.
29. Scott, A. D. and Sorkin, G. B. Faster exponential-time algorithms for Max 2-Sat, Max Cut, and Max k-Cut. In preparation.
30. Spencer, J. (1997) Enumerating graphs and Brownian motion. Comm. Pure Appl. Math. 50 291-294.
31. Trevisan, L., Sorkin, G. B., Sudan, M. and Williamson, D. P. (2000) Gadgets, approximation, and linear programming. SIAM J. Comput. 29 2074-2097.
32. Wright, E. M. (1980) The number of connected sparsely edged graphs III: Asymptotic results. J. Graph Theory 4 393-407.