Login / Signup
An optimal approximation for submodular maximization under a matroid constraint in the adaptive complexity model.
Eric Balkanski
Aviad Rubinstein
Yaron Singer
Published in:
STOC (2019)
Keyphrases
</>
objective function
computational model
closed form
high level
probabilistic model
management system
feature selection
dynamic programming
parameter estimation
optimal policy
statistical model
greedy algorithm
formal model