Adaptive Submodular Optimization under Matroid Constraints

Clinical Orthopaedics and Related Research, Volume abs/1101.4, 2011.

Cited by: 20|Bibtex|Views5
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com|arxiv.org

Abstract:

Many important problems in discrete optimization require maximization of a monotonic submodular function subject to matroid constraints. For these problems, a simple greedy algorithm is guaranteed to obtain near-optimal solutions. In this article, we extend this classic result to a general class of adaptive optimization problems under par...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments