Submodular Maximization beyond Non-negativity: Guarantees, fast algorithms, and applications

Keyphrases

• Approximation Guarantee 100%
• Fast Algorithm 100%
• Submodular Maximization 100%
• Non-negativity 100%
• Monotone 50%
• Polynomial-time Algorithm 50%
• Hardness Results 50%
• Sweeping 50%
• Oracle 50%
• Boston 50%
• Vertex Cover 50%
• Unconstrained Settings 50%
• Cardinality Constraint 50%
• Strong Approximation 50%
• Feasible Set 50%

Computer Science

• Approximation (Algorithm) 100%
• Fast Algorithm 100%
• Relative Importance 50%
• polynomial-time algorithm 50%
• Design Experiment 50%
• Cardinality 50%

Mathematics

• Design Experiment 50%