Approximate Graph Coloring by Semidefinite Programming

Journal of the ACM

Volumn 45, Issue 2, 1998, Pages 246-265

  Karger, David ^a,c   Motwani, Rajeev ^b,d   Sudan, Madhu ^a,c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b STANFORD UNIVERSITY   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^d Stanford University   (United States)

Author keywords

Algorithms; Approximation algorithms; F.2.2 Analysis of Algorithms and Problem Complexity : Nonnumerical Algorithms and Problems; G.2.1 Discrete Mathematics : Combinatorics; G.2.2 Discrete Mathematics : Graph Theory; Optimization; Theory

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; RANDOM PROCESSES;

APPROXIMATION ALGORITHMS; CHROMATIC NUMBERS; GRAPH COLORING; RANDOMIZED ALGORITHMS;

ALGORITHMS;

EID: 0032028848     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/274787.274791     Document Type: Article

References (42)

1. ALDOUS, D. 1989. Probability Approximations via the Poisson Clumping Heuristic. Springer-Verlag, New York.
2. ALIZADEH, F. 1995. Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM J. Optim. 5, 1, 13-51.
3. ALON, N., AND KAHALE, N. 1994. A spectral technique for coloring random 3-colorable graphs. In Proceedings of the 26th ACM Symposium on Theory of Computing (Montreal, Que., Canada, May 23-25). ACM, New York, pp. 346-353.
4. ALON, N., AND KAHALE, N. 1998. Approximating the independence number via the Theta function. Math. Prog., in press.
5. ARORA, S., LUND, C., MOTWANI, R., SUDAN, M., AND SZEGEDY, M. 1992. Proof verification and hardness of approximation problems. In Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science. IEEE, New York, pp. 14-23.
6. BELLARE, M., AND SUDAN, M. 1994. Improved non-approximability results. In Proceedings of the 26th ACM Symposium on Theory of Computing (Montreal, Que., Canada, May 23-25). ACM, New York, pp. 184-193.
7. BERGE, C. 1973. Graphs and hypergraphs. North-Holland, Amsterdam, The Netherlands.
8. BLUM, A. 1994. New approximation algorithms for graph coloring. J. ACM 41 3 (May), 470-516.
9. BLUM, A., AND KARGER, D. 1997. Improved approximation for graph coloring. Inf. Proc. Lett. 61, 1 (Jan.), 49-53.
10. BOPPANA, R. B., AND HALLDORSSON, M. M. 1992. Approximating maximum independent sets by excluding subgraphs. BIT 32, 180-196.
11. BRIGGS, P., COOPER, K. D., KENNEDY, K., AND TORCZON, L. 1989. Coloring heuristics for register allocation. In Proceedings of the SIGPLAN 89 Conference on Programming Language Design and Implementation (Portland, Ore., June 21-23). ACM, New York, pp. 275-284.
12. CHAITIN, G. J. 1982. Register allocation and spilling via graph coloring. In Proceedings of the SIGPLAN 89 Conference on Compiler Construction ACM, New York, pp. 98-101.
13. CHAITIN, G. J., AUSLANDER, M. A., CHANDRA, A. K., COCKE, J., HOPKINS, M. E., AND MARKSTEIN, P. W. 1981. Register allocation via coloring. Comput. Lang. 6, 47-57.
14. FELLER, W. 1968. An Introduction to Probability Theory and Its Applications. Wiley, New York.
15. FRANKL, P., AND RODL, V. 1994. Forbidden intersections. Trans. AMS. 300, 259-286.
16. FEIGE, U. 1995. Randomized graph products, chromatic numbers, and the Lovasz theta-function. In Proceedings of the 27th Annual ACM Symposium on Theory of Computing (Las Vegas, Nev., May 29-June 1). ACM, New York, pp. 635-640.
17. FEIGE, U., GOLDWASSER, S., LOVÁSZ, L., SAFRA, S., AND SZEGEDY, M. 1996. Interactive proofs and the hardness of approximating cliques. J. ACM 43, 2 (Mar.), 268-292.
18. FEIGE, U., AND KILIAN, J. 1996. Zero knowledge and chromatic number. In Proceedings of the 11th Annual Conference on Computational Complexity. IEEE Computer Society Press, Los Alamitos, Calif., pp. 278-287.
19. FRIEZE, A., AND JERRUM, M. 1994. Improved approximation algorithms for MAX k-CUT and MAX BISECTION. Manuscript.
20. GAREY, M. R., AND JOHNSON, D. S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York.
21. GOEMANS, M. X., AND WILLIAMSON, D. P. 1995. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42, 6 (Nov.), 1115-1145.
22. GOLUB, G. H., AND VAN LOAN, C. F. 1983. Matrix Computations. Johns Hopkins University Press, Baltimore, Md.
23. GRÖTSCHEL, M., LOVÁSZ, L., AND SCHRIJVER, A. 1981. The ellipsoid method and its consequences in combinatorial optimization. combinatorica 1, 169-197.
24. GRÖTSCHEL, M., LOVÁSZ, L., AND SCHRIJVER, A. 1987. Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, New York.
25. HALLDÓRSSON, M. M. 1993. A still better performance guarantee for approximate graph coloring. Inf. Proc. Lett. 45, 19-23.
26. 1-ε. In Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science. IEEE, New York.
27. JOHNSON, D. S. 1974. Worst case behavior of graph coloring algorithms. In Proceedings of the 5th Southeastern Conference on Combinatorics, Graph Theory and Computing. Congressus Numerantium X, pp. 513-527.
28. KHANNA, S., LINIAL, N., AND SAFRA, S. 1992. On the hardness of approximating the chromatic number. In Proceedings of the 2nd Israeli Symposium on Theory and Computing Systems. IEEE Computer Society Press, Los Alamitos, Calif., pp. 250-260.
29. KHANNA, S., MOTWANI, R., SUDAN, M., AND VAZIRANI, U. 1994. On syntactic versus computational views of approximability. In Proceedings of the 35th IEEE Symposium on Foundations of Computer Science. IEEE, New York, pp. 819-830.
30. KNESER, M. 1955. Aufgabe 300. Jber. Deutsch. Math.-Verein. 58.
31. KNUTH, D. E. 1971. The Art of Computer Programming. Addison-Wesley, Reading, Mass.
32. KNUTH, D. E. 1994. The sandwich theorem. Elect. J. Combin. 1, 1-48.
33. LOVÁSZ, L. 1979. On the Shannon capacity of a graph. IEEE Trans. Inf. Theory IT-25, 1-7.
34. LUND, C., AND YANNAKAKIS, M. 1993. On the hardness of approximating minimization problems. In Proceedings of the 25th ACM Symposium on Theory of Computing (San Diego, Calif., May 16-18). ACM, New York, pp. 286-293.
35. MAHAJAN, S., AND RAMESH, H. 1995. Derandomizing semidefinite programming based approximation algorithms. In Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science. IEEE, New York, pp. 162-169.
36. MILNER, E. C. 1968. A combinatorial theorem on systems of sets. J. London Math. Soc. 43, 204-206.
37. MOTWANI, R., AND NAOR, J. 1993. On exact and approximate cut covers of graphs. Manuscript.
38. MOTWANI, R., AND RAGHAVAN, P. 1995. Randomized Algorithms. Cambridge University Press, Cambridge, Mass.
39. RÉNYI, A. 1970. Probability Theory. Elsevier, New York.
40. SZEGEDY, M. 1994. A note on the θ number of Lovász and the generalized Delsarte bound. In Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science. IEEE, New York, pp. 36-39.
41. WIGDERSON, A. 1983. Improving the performance guarantee for approximate graph coloring. J. ACM 30, 729-735.
42. WOOD, D. C. 1969. A technique for coloring a graph applicable to large-scale optimization problems. Comput. J. 12, 317.