Non-monotone submodular maximization under matroid and knapsack constraints

Full Text: PDFPDF Buy this ArticleBuy this Article
Authors: Jon Lee IBM TJ Watson Research, Yorktown Heights, NY, USA
Vahab S. Mirrokni Google Research, New York, NY, USA
Viswanath Nagarajan Carnegie Mellon University, Pittsburgh, PA, USA
Maxim Sviridenko IBM TJ Watson Research, Yorktown Heights, NY, USA
Non-monotone submodular maximization under matroid and knapsack constraints Published by ACM 2009 Article
Bibliometrics Data  Bibliometrics
· Downloads (6 Weeks): 10
· Downloads (12 Months): 72
· Downloads (cumulative): 367
· Citation Count: 18

Published in:
Cover Image
 
· Proceeding
STOC '09 Proceedings of the 41st annual ACM symposium on Theory of computing
Pages 323-332
ACM New York, NY, USA ©2009
table of contents ISBN: 978-1-60558-506-2 doi>10.1145/1536414.1536459

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