A New Approximation Guarantee for Monotone Submodular Function Maximization via Discrete Convexity.
Tasuku SomaYuichi YoshidaPublished in: ICALP (2018)
Keyphrases
- submodular functions
- greedy algorithm
- approximation guarantees
- objective function
- approximation ratio
- greedy algorithms
- facility location problem
- approximation algorithms
- dynamic programming
- worst case
- knapsack problem
- energy function
- combinatorial optimization
- lower bound
- search algorithm
- feasible solution
- tabu search
- optimization problems
- cost function
- computational complexity
- optimal solution