Constructing worst case instances for semidefinite programming based approximation algorithms

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Noga Alon Department of Mathematics, Raymond and Beverly Sackler, Faculty of Exact Sciences, Tel Aviv University, Tel Aviv 69978, Israel
Benny Sudakov Department of Mathematics, Princeton University, Princeton, NJ and Institute for Advanced Study, Princeton, NJ
Uri Zwick Department of Computer Science, Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv 69978, Israel
Published in:
· Proceeding
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Pages 92-100
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©2001
table of contents ISBN:0-89871-490-7
Constructing worst case instances for semidefinite programming based approximation algorithms 2001 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 11
· Downloads (cumulative): 178
· Citation Count: 1


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