Faster approximation algorithms for maximizing a monotone submodular function subject to a b-matching constraint.
Kaito FujiiPublished in: Inf. Process. Lett. (2016)
Keyphrases
- approximation algorithms
- facility location problem
- submodular functions
- np hard
- special case
- worst case
- greedy algorithm
- vertex cover
- minimum cost
- primal dual
- energy function
- approximation ratio
- constant factor
- randomized algorithms
- polynomial time approximation
- global constraints
- constant factor approximation
- facility location
- image processing
- convex optimization
- probabilistic model
- active learning