Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Michel X. Goemans Massachusetts Institute of Technology, Cambridge
David P. Williamson IBM T. J. Watson Research Center, Yorktown Heights, NY
Published in:
· Journal
Journal of the ACM (JACM) JACM Homepage archive
Volume 42 Issue 6, Nov. 1995
Pages 1115-1145
ACM New York, NY, USA
table of contents doi>10.1145/227683.227684
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming Published by ACM 1995 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 52
· Downloads (12 Months): 501
· Downloads (cumulative): 4,491
· Citation Count: 425


Tools and Resources

Share:

|
feedback Feedback | Switch to single page view (no tabs)

Powered by The ACM Guide to Computing Literature


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player
The ACM Guide to Computing Literature
All Tags
Export Formats
 
 
Save to Binder