A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints.
Eyal MizrachiRoy SchwartzJoachim SpoerhaseSumedha UniyalPublished in: CoRR (2018)
Keyphrases
- objective function
- lower bound
- upper bound
- greedy algorithm
- constrained optimization
- worst case
- constraint satisfaction
- neural network
- approximation algorithms
- geometric constraints
- error bounds
- posterior marginals
- error tolerance
- submodular functions
- approximation ratio
- resource constraints
- energy minimization
- closed form
- linear programming
- information systems
- information retrieval