SODA 2019
Submodular Maximization with Nearly Optimal Approximation, Adaptivity and Query Complexity
Abstract
No abstract is available in the live database for this paper.
Authors
Keywords
No keywords are indexed for this paper.
Context
- Venue
- ACM-SIAM Symposium on Discrete Algorithms
- Archive span
- 1990-2025
- Indexed papers
- 4674
- Paper id
- 966599592880410303