An extension of the Lovász local lemma, and its applications to integer programming

Full Text: PDFPDF Buy this ArticleBuy this Article
Author: Aravind Srinivasan Dept. of Information Systems & Computer Science, National University of Singapore, Singapore 119260
Published in:
· Proceeding
SODA '96 Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Pages 6-15
Society for Industrial and Applied Mathematics Philadelphia, PA, USA ©1996
table of contents ISBN:0-89871-366-8
An extension of the Lovász local lemma, and its applications to integer programming 1996 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 1
· Downloads (12 Months): 7
· Downloads (cumulative): 369
· Citation Count: 14


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