SIGN IN
SIGN UP
Non-monotone submodular maximization under matroid and knapsack constraints
Full Text:
PDF
Get 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
2009 Article
Bibliometrics
· Downloads (6 Weeks): 4
· Downloads (12 Months): 63
· Downloads (cumulative): 550
· Citation Count: 34
Published in:
· Proceeding
STOC '09
Proceedings of the forty-first 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
Buy this Article
Recommend the ACM DL
to your organization
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
STOC '17
Share:
|
Author Tags
algorithms
approximation algorithms
design and analysis of algorithms
knapsacks
matroids
submodular functions
theory
Contact Us
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Advertisements
Powered by
Did you know the ACM DL App is now available?
Did you know your Organization can subscribe to the ACM Digital Library?
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder