Efficient approximation algorithms for semidefinite programs arising from MAX CUT and coloring

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129452, Issue , 1996, Pages 338-347

  Klein, Philip ^a   Lu, Hsueh I ^a  

^a Brown Univerity   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTATION THEORY; GRAPH THEORY; GRAPHIC METHODS; POLYNOMIAL APPROXIMATION; COMPUTATIONAL COMPLEXITY; EIGENVALUES AND EIGENFUNCTIONS; ITERATIVE METHODS; LINEAR PROGRAMMING; MATRIX ALGEBRA; NUMERICAL METHODS; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING;

EFFICIENT APPROXIMATION ALGORITHMS; GRAPH COLORINGS; GRAPH CUT; MAX CUT; OPTIMAL SOLUTIONS; POLYNOMIAL-TIME; SEMIDEFINITE PROGRAMS; GRAPH COLORING; GRAPH MAX CUT; SEMIDEFINITE PROGRAMMING;

APPROXIMATION ALGORITHMS; ALGORITHMS;

EID: 0029711246     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/237814.237980     Document Type: Conference Paper

References (25)

1. F. Alizadeh. Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM Journal on Optimization, 5(1):13-51, 1995.
2. F. Chatelin. Eigenvalues of Matrices. John Wiley k Sons, 1993.
3. R. M. Freund. Complexity of an Algorithm for Finding an Approximate Solution of a Semi-Definite Program with no Regularity Assumption. Technical Report OR-302-94, Operations Research Center, M. I. T., 1994.
4. M. X. Goemans and D. P. Williamson. 878-approximation algorithms for MAX CUT and MAX 2SAT. In Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, pages 422-431, Montréal, Québec, Canada, 23-25 May 1994.
5. M. Grötschel, L. Lovasz, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization. Springer Verlag, 1988.
6. C. Helmberg, F. Rendl, R. J. Vanderbei, and H. Wolkowicz. An interior-point method for semidefinite programming. SIAM J. Optim., 1994. (To appear).
7. R. A. Horn and C. R. Johnson. Matrix Analysis. Cambridge University Press, 1985.
8. F. Jarre. An interior-point method for minimizing the maximum eigenvalue of a linear combination of matrices. SIAM Journal on Control and Optimization, 31(5):1360-1377, 1993.
9. D. Karger, R. Motwani, and M. Sudan. Approximate graph coloring by semidefinite programming. In 35th Annual Symposium on Foundations of Computer Science, pages 2-13, Santa Fe, New Mexico, 20-22 Nov. 1994. IEEE.
10. P. Klein, S. Plotkin, C. Stein, and E. Tardos. Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts. SIAM Journal on Computing, 23(3):466-487, June 1994.
11. D. E. Knuth. The Art of Computer Programming, volume 2. Addison-Wesley, 1973.
12. M. Kojima, S. Shindoh, and S. Hara. Interior-Point Methods for the Monotone Linear Complementarity Problem in Symmetric Matrices. Technical Report B-282, Department of Information Sciences, Tokyo Inst. of Technology, 1994.
13. P. Lancaster and M. Tismenetsky. The Theory of Matrices. Academic Press, 1985.
14. T. Leighton, F. Makedon, S. Plotkin, C. Stein, E. Tardos, and S. Tragoudas. Fast approximation algorithms for multicommodity flow problems. In Proceedings of the Twenty Third Annual ACM Symposium on Theory of Computing, pages 101-111, New Orleans, Louisiana, 6-8 May 1991.
15. L. Lovász. On the Shannon Capacity of a graph. IEEE Transactions on Information Theory, IT-25:1-7, 1979.
16. L. Lovasz and A. Schrijver. Cones of Matrices and Setfunctions, and 0-1 Optimization. SIAM Journal on Optimization, 1(2):166-190, 1991.
17. Y. Nesterov and A. Nemirovskii. Interior Point Polynomial Methods in Convex Programming: Theory and Applications. Society for Industrial and Applied Mathematics, Philadelphia, 1994.
18. S. A. Plotkin, D. B. Shmoys, and É. Tardos. Fast approximation algorithms for fractional packing and covering problems. In 32nd Annual Symposium on Foundations of Computer Science, pages 495-504, San Juan, Puerto Rico, 1-4 Oct. 1991. IEEE.
19. G. B. Price. Multivariable Analysis. Springer-Verlag, 1984.
20. F. Rendí, R. Vanderbei, and H. Wolkowicz. A primal-dual interior-point method for the max-min eigenvalue problem. Technical report, University of Waterloo, Dept. of Combinatorics and Optimization, 1993.
21. S. Sahni and T. Gonzalez. P-complete approximation problems. Journal of the ACM, 23(3):555-565, July 1976.
22. F. Shahrokhi and D. W. Matula. The maximum concurrent flow problem. Journal of the ACM, 37(2):318-334, Apr. 1990.
23. P. M. Vaidya. Speeding-up linear programming using fast matrix multiplication (extended abstract). In 30th Annual Symposium on Foundations of Computer Science, pages 332-337, Research Triangle Park, North Carolina, 30 Oct.-l Nov. 1989. IEEE.
24. L. Vandenberghe and S. Boyd. A primal-dual potential reduction method for problems involving matrix inequalities. Technical report, Information Systems Laboratory, Department of Electrical Engineering, Stanford University, Stanford, CA, January 1993. Math. Prog. (to appear).
25. A. Yoshise. An optimization method for convex programs-interior-point method and analytical center. Systems, Control and Information, 38(3):155-160, Mar. 1994.