An Optimal Approximation for Submodular Maximization under a Matroid Constraint in the Adaptive Complexity Model.
Eric BalkanskiAviad RubinsteinYaron SingerPublished in: CoRR (2018)
Keyphrases
- closed form
- probabilistic model
- computational model
- high level
- objective function
- special case
- cost function
- dynamic programming
- statistical model
- mathematical model
- formal model
- data sets
- approximation algorithms
- greedy algorithm
- experimental data
- process model
- parameter estimation
- model selection
- management system
- optimal solution
- multiscale