Semirandom models as benchmarks for coloring algorithms

Proceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics

Volumn 2006, Issue , 2006, Pages 211-221

  Krivelevich, Michael ^a   Vilenchik, Dan ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BENCHMARKING; HEURISTIC METHODS; MATHEMATICAL MODELS; POLYNOMIALS; PROBABILITY;

COLORING ALGORITHMS; POLYNOMIAL TIME ALGORITHM; RANDOM GRAPH MODEL; SEMIRANDOM MODELS;

COMPUTATIONAL METHODS;

EID: 33646838819     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972962.4     Document Type: Conference Paper

References (25)

1. N. Alon and N. Kahale. A spectral technique for coloring random 3-colorable graphs, SIAM J. Comput., 26 (1997), pp. 1733-1748.
2. N. Alon, M. Krivelevich, and B. Sudakov. Finding a large hidden clique in a random graph. Random Structures and Algorithms, 13 (1998), pp. 457-466.
3. N. Alon and J. H. Spencer. The probabilistic method. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience [John Wiley & Sons], New York, second edition, 2000.
4. A. Blum and J. Spencer. Coloring random and semirandom k-colorable graphs. J. of Algorithms, 19 (1995), pp. 204-234.
5. B. Bollobás. The chromatic number of random graphs. Combinatorica, 1 (1988), pp. 49-55.
6. J. Böttcher. Coloring sparse random k-colorable graphs in polynomial expected time. In Proc, 30th International Symp. on Mathematical Foundations of Computer Science. Lecture Notes in Comput. Sci. 3618 (2005), pp. 156-167.
7. A. Coja-Oghlan. Coloring semirandom graphs optimally. In Proc. 31st International Colloquium on Automata, Languages, and Programming, pp. 383-395, 2004.
8. A. Coja-Oghlan. The Lovász number of random graphs. Combin. Probab. Comput. 14 (2005) pp. 439-465.
9. U. Feige and J. Kilian. Heuristics for semirandom graph problems. J. Comput. and Syst. Sci., 63 (2001), pp. 639-671.
10. U. Feige and J. Kilian. Zero knowledge and the chromatic number. J. Comput. and Syst. Sci., 57 (1998), pp. 187-199.
11. U. Feige and R. Krauthgamer. Finding and certifying a large hidden clique in a semirandom graph. Random Structures and Algorithms, 16 (2000), pp. 195-208.
12. U. Feige and E. Ofek. Spectral techniques applied to sparse random graphs. Random Structures and Algorithms, 27 (2000), pp 251-275.
13. U. Feige and D. Vilenchik. A local search algorithm for 3SAT. Technical report, The Weizmann Institute of Science, 2004.
14. A. Flaxman. A spectral technique for random satisflable 3CNF formulas. In Proc. 14th ACM-SIAM Symp. on Discrete Algorithms, pp. 357-363, 2003.
15. A. Frieze, M. Jerrum. Improved approximation algorithms for MAX k-CUT and MAX BISECTION. Algorithmica, 18 (1997), pp. 67-81.
16. A. Frieze and C. McDiarmid. Algorithmic theory of random graphs. Random Structures and Algorithms, 10 (1997), pp. 5-42.
17. M. Grötschel, L. Lovász, and A. Schrijver. Geometric algorithms and combinatorial optimization. Algorithms and Combinatorics (2). Springer-Verlag, Berlin, second edition, 1993.
18. C. Helmberg. Semidefinite programming. European Journal of Operational Research, 137 (2002), pp. 461-482.
19. T. R. Jensen and B. Toft. Graph coloring problems. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley-Interscience [John Wiley & Sons], New York, 1995.
20. D. Karger, R. Motwani, and M. Sudan. Approximate graph coloring by semidefinite programming. J. of the ACM, 45 (1998), pp. 246-265.
21. M. Krivelevich. Deciding k-colorability in expected polynomial time. Info. Process. Letters, 81 (2002), pp. 1-6.
22. M. Krivelevich and V. H. Vu. Approximating the independence number and the chromatic number in expected polynomial time. J. Comb. Optim., 6 (2002), pp. 143-155.
23. L. Kučera. Expected behavior of graph coloring algorithms. Proc. Fundamentals of Computation Theory, 56 (1977), pp. 447-451.
24. T. Łuczak. The chromatic number of random graphs. Combinatorica, 11 (1991), pp. 45-54.
25. D. Vilenchik. Finding a satisfying assignment for semirandom satisfiable 3CNF formulas. Master's thesis, The Weizmann Institute of Science, Rehovot, Israel, January 2004.