Randomized approximation of the constraint satisfaction problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1097, Issue , 1996, Pages 76-87

  Lau, Hoong Chuin ^a   Watanabe, Osamu ^a  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84947906598     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61422-2_122     Document Type: Conference Paper

References (14)

1. Noga Alon and Joe Spencer. The Probabilistic Method. Wiley Interscience Ser. Disc. Math. and Optimiz., 1992.
2. S. Arora, C. Lund, R Motwani, M Sudan, and M Szegedy. Proof verification and hardness of approximation problems. In Proc. 33th IEEE Symp. on, Found. of Comp. Sci., pages 2-13, 1993.
3. P. Berman and G. Schnitger. On the complexity of approximating the independent set problem, Infor, & Comput., 96:77-94, 1992.
4. P. Erdös and L. Selfridge. On a combinatorial game. Y. Comb. Theory Series A, 14:298-301, 1989.
5. Uriel Feige and László Lovász, Two-prover one-round proof systems: Their power and their problems. In Proc. 24th ACM Syrup. on Theory of Computing, pages 733-744, 1992.
6. Michel X Goemans and David P. Williamson. Approximation algorithms for MAX CUT and MAX 2SAT. In Proc. 26th A CM Syrup. on Theory of Computing, pages 422-431, 1994. Full version to appear in J. ACM.
7. S. Khanna, R. Motwani, M. Sudan, and U. Vazirani. On syntactic versus computational views of approximability. In Proc. 35th IEEE Syrup. on Found. of Comp. Sci., 1994.
8. H. C. Lau. Approximation of constraint satisfaction via local search. In Proc. 4th Wrksp. on Algorithms and Data Structures (WADS), pages 461-472. Springer Verlag Lect. Notes Comp. Sci. (955), 1995.
9. S. Mahajan and H. Ramesh. Derandomizing semidefinite programming based approximation algorithms. In Proc. 36th IEEE Syrup. on Found. of Comp. Sci., pages 162 168, 1995.
10. Barrett O’Neill. Elementary Differential Geometry. Academic Press, New York, 1966.
11. Christos H. Papadimitriou and Mihalis Yannakakis. Optimization, approximation, and complexity classes. J. Comput. Sys. Sci., 43:425-440, 1991.
12. P. Raghavan and C. D. Thompson. Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica, 7(4):365-374, 1987.
13. Ran Raz. A parallel repetition theorem. In Proc. 27th ACM Syrup. on Theory of Computing, pages 447-456, 1995.
14. Luca Trevisan. Positive linear programming, parallel approximation and PCPs, 1996. Manuscript.