Computer assisted proof of optimal approximability results

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 496-505

  Zwick, Uri ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER AIDED ANALYSIS; CONSTRAINT SATISFACTION PROBLEMS;

APPROXIMABILITY; BOOLEAN CONSTRAINT; COMPUTER ASSISTED PROOF; INTERVAL ARITHMETIC; PERFORMANCE RATIO; REAL SOLUTIONS; SPHERICAL VOLUME; SYSTEM USE;

APPROXIMATION ALGORITHMS;

EID: 79955718215     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (43)

1. [AH77] K. Appel and W. Haken. Every planar map is four colorable. Part I. Discharging. Illinois Journal of Mathematics, 21:429-490, 1977.
2. [AHK77] K. Appel, W. Hakenn, and J. Koch. Every planar map is four colorable. Part ii. Reducibility. Illinois Journal of Mathematics, 21:491-597, 1977.
3. [ALM+98] S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and the hardness of approximation problems. Journal of the ACM, 45:501-555, 1998.
4. [ANS85] ANSI/IEEE. Standara 754-1985 for binary floatingpoint arithmetic. 1985. Reprinted in ACM SIGPLAN Notices, 22(2):9-25, 1987.
5. [AS98] S. Arora and S. Safra. Probabilistic checking of proofs: A new characterization of NP. Journal of the ACM, 45:70-122, 1998.
6. [AW00] T. Asano and D.P. Williamson. Improved approximation algorithms for MAX SAT. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, California, pages 96-105, 2000.
7. [Ber99] D.P. Bertsekas. Nonlinear Programming. Athena Scientific, second edition, 1999.
8. [BGS98] M. Bellare, O. Goldreich, and M. Sudan. Free bits, PCPs, and nonapproximability-towards tight results. SIAM Journal on Computing, 27:804-915, 1998.
9. [CK99] G. Coreliss and R.B. Kearfott. Global So-lotions User Guide (draft). Currently available from http://www.mscs.mu.edu/-globsol/User^Guide/index.html, 1999.
10. [FG95] U. Feige and M.X. Goemans. Approximating the value of two prover proof systems, with applications to MAX-IS AT and MAX-DICUT. In Proceedings of the 3nd Israel Symposium on Theory and Computing Systems, Tel Aviv, Israel, pages 182-189, 1995.
11. [FGL+96] U. Feige, S. Goldwasser, L. Lovasz, S. Safra, and M. Szegedy. Interactive proofs and the hardness of approximating cliques. Journal of the ACM, 43:268-292, 1996.
12. [FL01 ] U. Feige and M. Langberg. The RPR2 rounding technique for semidefinite programs. In Proceedings of the 28th International Colloquium on Automata, Languages and Programming, Crete, Greece, pages 213-224, 2001.
13. [GMT00] D. Gabai, R. Meyerhoff, and N. Thurston. Homotopy hyperbolic 3-manifolds are hyperbolic, 2000. To appear in Annals of Mathematics.
14. [Gol91] D. Goldberg. What every computer scientist should know about floating-point arithmetic. ACM Computing Surveys, 23:5-48, 1991.
15. [GW95] M.X. Goemans and D.P. Williamson. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, 42:1115-1145, 1995.
16. [Hal97a] T. C. Hales. Sphere packings. I. Discrete & Computational Geometry. 17, 1, 1-51, 1997
17. [Hal97b] T. C. Hales. Sphere packings. II. Discrete & Computational Geometry, 18(2): 135-149, 1997.
18. [Hal98] T.C. Hales. The Kepler conjecture, 1998. Mathematics arXiv http://arxiv.org/abs/math.MG/9811078.
19. [HalOO] T.C. Hales. Cannonballs and honeycombs. Notices of the American Mathematical Society, 47(4):440-449, 2000.
20. [HalOl] T.C. Hales. The honeycomb conjecture. Discrete & Computational Geometry, 25(1): 1-22, 2001.
21. [Han92] E. Hansen. Global optimization using Interval Analysis. Marcel Dekker, 1992.
22. [Hls97] J. Hastad. Some optimal inapproximability results. In Proceedings of the 29th Annual ACM Symposium on Theory of Computing, El Paso, Texas, pages 1-10, 1997. Full version available as E-CCC Report number TR97-037.
23. [Hau98] J. Hauser. SoftFloat. http://www.es.berkeley.edu/-jhauser/arithmetic/softfloat.html 1998.
24. [HM98] T.C. Hales and S. McLaughlin. A proof of the dodecahedral conjecture, 1998. Mathematics arXiv http://arxiv.org/abss/math.MG/9811079.
25. [HP95] R. Horst and P.M. Pardalos, editors. Handbook of global optimization. Kluwer, 1995.
26. [HSOO] J. Hass and R. Schlafly. Double bubbles rmnirnize. Annals of Mathematics. Second Series, 151(2):459-515, 2000.
27. [HZ99] E. Halperin and U. Zwick. Approximation algorithms for MAX 4-SAT and rounding procedures for semidefinite programs. In Proceedings of the 7th Conference on Integer Programming and Combinatorial Optimization, Graz, Austria, pages 202-217, 1999.
28. [Kah96a] W. Kalian. Lecture notes on the status of IEEE standard 754 for binary floating-point arithmetic, http://http. cs .berkeley. edu/-wkahan/ieee754status/ieee754.ps, 1996.
29. [Kah96b] W. Kahan. What can you learn about floating-point arithmetic in one hour? http://http.cs.berkeley.edu/-wkahan/ieee754status/cs267fp.ps, 1996.
30. [Kea96] R.K. Kearfott. Rigorous global search: continuous problems. Kluwer, 1996.
31. [KZ97] H. Karloff and U. Zwick. A 7/8-approximation algorithm for MAX 3SAT? In Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, Miami Beach, Florida, pages 406-415, 1997.
32. [Mat96] The MathWorks Inc. MATLAB optimization toolbox, User's guide, Version 5, 1996.
33. [OveOl] M.L. Overton. Numerical Computing With IEEE Floating Point Arithmetic. SIAM, 2001.
34. [Raz98] R. Raz. A parallel repetition theorem. SIAM Journal on Computing, 27:763-803, 1998.
35. [RSST97] N. Robertson, D. Sanders, P. Seymour, and R. Thomas. The four-colour theorem. Journal of Combinatorial Theory, Series B, 70(1):2-44, 1997.
36. [Sch58] L. Schlafli. On the multiple integral jndxdy...dz, whose limits are pi -aix + biy + ... + h-z > 0, p2 > 0, ... , pn > 0, andx2+y2+.. .+z2 < 1. Quarterly Journal of Mathematics (Oxford), 2:269-300, 1858. Continued in 3. 1860 54-68 and pp. 97-108
37. [Str97] B. Stroustrup. The C++ programming language. Addison-Wesley, third edition, 1997.
38. [Van98] P. Van Hentenryck. A gentle introduction to Numerica. Artificial Intelligence, 103:209-235, 1998.
39. [VMD97] P. Van Hentenryck, L. Michel, and Y. Deville. Numerica -A modeling language for global optimiztion. MIT Press, 1997.
40. [W6199] S. Wolfram. The Mathematica book. Cambridge University Press, fourth edition, 1999.
41. [Zwi98] U. Zwick. Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, California, pages 201-210, 1998.
42. [Zwi991 U. Zwick. Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to max cut and other problems. In Proceedings of the 31th Annual ACM Symposium on Theory of Computing, Atlanta, Georgia, pages 679-687, 1999.
43. [ZwiOO] U. Zwick. Analyzing the MAX 2-SAT and MAX DI-CUT approximation algorithms of Feige and Goemans. Submitted for publication, 2000.