Approximating maximum clique by removing subgraphs

SIAM Journal on Discrete Mathematics

Volumn 18, Issue 2, 2004, Pages 219-225

  Feige, Uriel ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Approximation algorithm; Clique; Independent set

Indexed keywords

ALGORITHMS; GRAPH THEORY; ITERATIVE METHODS; NUMBER THEORY; SET THEORY; THEOREM PROVING;

APPROXIMATION ALGORITHM; CLIQUE; INDEPENDENT SET;

APPROXIMATION THEORY;

EID: 14644431984     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S089548010240415X     Document Type: Article

References (12)

1. N. ALON AND N. KAHALE, Approximating the independence number via the θ-function, Math. Programming, 80 (1998), pp. 253-264.
2. B. BERGER AND J. ROMPEL, A better performance guarantee for approximate graph coloring, Algorithmica, 5 (1990), pp. 459-466.
3. 3/14)-coloring algorithm for 3-colorable graphs, Inform. Process. Lett., 61 (1997), pp. 49-53.
4. R. BOPPANA AND M. HALLDORSSON, Approximating maximum independent sets by excluding subgraphs, BIT, 32 (1992), pp. 180-196.
5. U. FEIGE AND J. KILIAN, Zero knowledge and the chromatic number, J. Comput. System Sci., 57 (1998), pp. 187-199.
6. M. HALLDORSSON, A still better performance guarantee for approximate graph coloring, Inform. Process. Lett., 45 (1993), pp. 19-23.
7. E. HALPERIN, R. NATHANIEL, AND U. ZWICK, Coloring k-colorable graphs using relatively small palettes, J. Algorithms, 45 (2002), pp. 72-90.
8. 1-ε, Acta Math., 182 (1999), pp. 105-142.
9. D. KARGER, R. MOTWANI, AND M. SUDAN, Approximate graph coloring by semidefinite programming, J. ACM, 45 (1998), pp. 246-265.
10. S. KHOT, Improved inapproximability results for maxclique, chromatic number and approximate graph coloring, in Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, Las Vegas, NV, 2001, IEEE Computer Society Press, Los Alamitos, CA, 2001, pp. 600-609.
11. B. SUDAKOV, A new lower bound for a Ramsey-type problem, Combinatorica, to appear.
12. A. WlGDERSON, Improving the performance guarantee of approximate graph coloring, J. ACM, 30 (1983), pp. 729-735.