Derandomizing approximation algorithms based on semidefinite programming

SIAM Journal on Computing

Volumn 28, Issue 5, 1999, Pages 1641-1663

  Mahajan, Sanjeev ^a   Ramesh, H ^b  

^a AGERE SYSTEMS   (United States)

^b INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; INTEGRATION; MATHEMATICAL PROGRAMMING; POLYNOMIALS; RANDOM PROCESSES;

APPROXIMATION ALGORITHM; DERANDOMIZATION; RANDOM CUT ALGORITHM; SEMIDEFINITE PROGRAMMING;

ALGOL (PROGRAMMING LANGUAGE);

EID: 0032620819     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539796309326     Document Type: Article

References (18)

1. N. ALON AND N. KAHALE, Approximating the independence number via the θ-function, Math. Programming, 80 (1998), pp. 253-264.
2. N. ALON, P. KELSEN, S. MAHAJAN, AND H. RAMESH, Approximately coloring hypergraphs, Nordic J. Comput. 3 (1996), pp. 425-439.
3. A. BLUM, New approximation algorithms for graph coloring. J. Assoc. Comput. Mach., 41 (1994). pp. 470-516.
4. R. BOPPANA AND M. HALLDORSSON, Approximating maximum independent sets by excluding subgraphs, BIT, 32 (1992), pp. 180-196.
5. W. FELLER, Introduction to Probability Theory and its Applications. Vol. 1, John Wiley. New-York, 1966.
6. U. FEIGE AND M. GOEMANS, Approximating the value of two prover proof systems, with applications to Max-2Sat and Max- Dicut, Proc. 3rd Israeli Symposium on Theory of Computing and Systems, Tel Aviv, 1995, pp. 182-189.
7. A. FRIEZE AND M. JERRUM, Improved approximation algorithms for Max k-Cut and Max Bi-section, Integer Programming and Combinatorial Optimization. Lecture Notes in Comput. Sci., Springer-Verlag, Berlin, 1995, pp. 1115-1165.
8. M. GRÖTSCHEL, L. LOVÁSZ, AND A. SCHRIJVER, Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, New Vork, 1987.
9. M. GOEMANS AND D. WILLIAMSON, Improved approximation, algorithms for maximum cut and satisfiability problems using semidefinite programming, J. Assoc. Comput. Mach., 42 (1996), pp. 1115-1145.
10. M. HALLDORSSON, A still better performance guarantee for approximate graph colouring, Inform. Process. Lett. 45 (1993), pp. 19-23.
11. D.S. JOHNSON, Worst case behaviour of graph coloring algorithms, in Proc. 5th South-Eastern Conference on Combinatorics, Graph Theory and Computing, Congressus Numeratium X, (1974), pp. 513-527.
12. D. KARGER, R. MOTWANI, AND M. SUDAN, Approximate graph coloring by semidefinite programming, Proc. 35th IEEE Symposium on Foundations of Computer Science, Santa Fe, NM, 1994, pp. 1-10.
13. S. KHANNA, N. LINIAL, AND S. SAFRA, On the hardness of approximating the chromatic number, Proc. 2nd Israeli Symposium on Theory and Computing Systems, 1993, pp. 250-260.
14. P. RAGHAVAN, Probabilistic construction of deterministic algorithms: Approximating packing integer programs, J. Comput. System Sci., 37 (1988), pp. 130-143.
15. P. RAGHAVAN, Randomized Approximation algorithms in combinatorial optimization, Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Comput. Sci., Springer-Verlag, New York, 1994, pp. 300-317.
16. J. SPENCER, Ten Lectures on the Probabilistic Method, SIAM, Philadelphia. PA, 1987.
17. A. WIGDERSON, Improving the performance guarantee of approximate graph coloring, J. Assoc. Comput. Mach., 30 (1983), pp. 729-735.
18. M. YANNAKAKIS, On the Approximation of Maximum Satisfiability, in Proc. 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, 1992, SIAM, Philadelphia, PA, pp. 1-9.