Approximating the independence number and the chromatic number in expected polynomial time

Journal of Combinatorial Optimization

Volumn 6, Issue 2, 2002, Pages 143-155

  Krivelevich, Michael ^a   Vu, Van H ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Approximation algorithms; Average running time; Sharp concentration

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; EIGENVALUES AND EIGENFUNCTIONS; GRAPH THEORY; MATRIX ALGEBRA; NUMBER THEORY; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES; TIME DOMAIN ANALYSIS;

APPROXIMATION ALGORITHMS; AVERAGE RUNNING TIME; CHROMATIC NUMBER; EDGE PROBABILITY; INDEPENDENCE NUMBER; POLYNOMIAL TIME ALGORITHM; RANDOM MATRIX; SHARP CONCENTRATION; TALAGRAND INEQUALITY;

POLYNOMIAL APPROXIMATION;

EID: 0036604770     PISSN: 13826905     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1013899527204     Document Type: Article

References (24)

1. Spectral techniques in graph algorithms
2. A spectral technique for coloring random 3-colorable graphs
3. Finding a large hidden clique in a random graph
4. The chromatic number of random graphs
5. Eigenvalues and graph bisection: An average case analysis
6. Approximating maximum independent sets by excluding subgraphs
7. The solution of some random NP-hard problems in polynomial expected time
8. Zero knowledge and the chromatic number
9. Finding and certifying a large hidden clique in a semi-random graph
10. The eigenvalues of random symmetric matrices
11. Coloring random graphs in polynomial expected time
12. A still better performance guarantee for approximate graph coloring
13. 1-ε
14. Reducibility among combinatorial problems
15. The greasy coloring is a bad probabilistic algorithm
16. On the shannon capacity of a graph
17. The chromatic number of random graphs
18. Coloring clique-free graphs in polynomial expected time
19. A new isoperimetric inequality for product measure, and the tails of sums of independent random variables