Greedy approximations for minimum submodular cover with submodular cost.
Peng-Jun WanDing-Zhu DuPanos M. PardalosWeili WuPublished in: Comput. Optim. Appl. (2010)
Keyphrases
- greedy algorithm
- min sum
- objective function
- greedy algorithms
- minimum cost
- dynamic programming
- greedy strategy
- high order
- submodular functions
- high cost
- energy minimization
- databases
- search algorithm
- np hard
- total cost
- lower bound
- database systems
- worst case
- active learning
- knapsack problem
- cost sensitive
- greedy heuristic
- case study
- feature selection
- neural network