# Metadata

- Title: Submodular Optimization with Submodular Cover and Submodular Knapsack Constraints
- Authors: Rishabh K. Iyer, Jeff A. Bilmes
- Year: 2013
- Venue: NeurIPS 2013
- Primary group: submodular
- Secondary tags: cover, knapsack, constrained-optimization, difference-of-submodular
- Problem: minimizing a submodular cost under a submodular cover constraint and maximizing under a submodular knapsack constraint
- Main guarantee: bounded approximation guarantees for SCSC and SCSK, tight up to log factors
- Key techniques: constrained reformulation of DS optimization, reduction between cover and knapsack variants, hardness plus approximation analysis
- Status: processed-deep
- Tags: #submodular #cover #knapsack #constraints #approximation
- Inbox source: inbox/NIPS-2013-submodular-optimization-with-submodular-cover-and-submodular-knapsack-constraints-Paper.pdf