Semidefinite Programs and Association Schemes

Computing (Vienna/New York)

Volumn 63, Issue 4, 1999, Pages 331-340

  Goemans, M X ^b   Rendl, F ^a  

^a UNIVERSITY OF KLAGENFURT   (Austria)

^b NONE

Author keywords

Association scheme; Maximum cut problem; Semicefinite programming

Indexed keywords

EID: 0347504564     PISSN: 0010485X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s006070050038     Document Type: Article

References (17)

1. Alon, N., Sudakov, B.: Bipartite subgraphs and the smallest eigenvalue. Technical Report, 1998.
2. Brouwer, A. E., Haemers, W. H.: Association schemes. In: Handbook of combinatorics (Graham, R. L., Grötschel, R. L., Lovász, L., eds.), pp. 747-771. Amsterdam: Elsevier, 1995.
3. Delorme, Ch., Poljak, S.: Laplacian eigenvalues and the max-cut problem. Math. Programm. 63, 557-574 (1993).
4. Delsarte, P.: An algebraic approach to the association schemes of coding theory. Philips Research Reports, Supplement, 10, 1973.
5. Goemans, M. X.: Semidefinite programming in combinatorial optimization. Math. Programm. 79, 143-161 (1997).
6. Goemans, M. X., Williamson, D. P.: Improved approximations algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42, 1115-1145, (1995).
7. Karloff, H.: How good is the Goemans-Williamson MAX CUT algorithm. In: Proc. of the 28th ACM Symp. on Theory Comput., pp. 427-434, 1996.
8. Knuth, D.E.: Combinatorial matrices. Notes written for the Institut Mittag-Leffler (1991). Revised version (from 1996) available at http : //www-cs-facuity.stanford.edu/~knuth/papers/cm.tex.gz.
9. Lovász, L.: On the Shannon capacity of a graph. IEEE Trans. Information Theory IT-25, 1-7 (1979).
10. Helmberg, C., Rendl, F., Vanderbrei, R. J., Wolkowicz, H.: An interior point method for semidefinite programming. SIAM J. Optim. 6, 342-361 (1996).
11. Horn, R. A., Johnson, C. R.: Matrix analysis. Cambridge: Cambridge University Press, 1985.
12. Karp, R. M.: Reducibility among combinatorial problems. In: Complexity of computer computation (Miller, R. E., Thather, J. W., eds.), pp. 85-103. New York: Plenum Press, 1972.
13. Mohar, B., Poljak, S.: Eigenvalues and the max-cut problem. Czech. Math. J. 115, 343-352 (1990).
14. Nesterov, Y., Nemirovskii, A.: Interior-point polynomial methods in convex programming. SIAM Studies in Applied Mathematics. Philadelphia: SIAM, 1994.
15. Poljak, S., Turzík, D.: Max-cut in circulant graph. Disc. Math. 108, 379-392 (1992).
16. Rendl, F.: Semidefinite programming and combinatorial optimization. Appl. Numer. Math. 29, 255-281 (1999).
17. Schrijver, A.: A comparison of the Delsarte and Lovász, bounds. IEEE Trans. Information Theory 25, 425-429 (1970).