Approximation algorithm for submodular maximization under submodular cover.
Naoto OhsakaTatsuya MatsuokaPublished in: UAI (2021)
Keyphrases
- objective function
- times faster
- linear programming
- experimental evaluation
- dynamic programming
- k means
- learning algorithm
- theoretical analysis
- preprocessing
- computational complexity
- worst case
- high accuracy
- search space
- recognition algorithm
- optimal solution
- improved algorithm
- particle swarm optimization
- expectation maximization
- monte carlo
- tree structure
- matching algorithm
- convex hull
- error bounds
- energy function
- detection algorithm
- genetic algorithm
- significant improvement
- similarity measure
- segmentation algorithm
- classification algorithm
- high order
- closed form
- computational cost
- np hard
- multi objective
- energy minimization
- approximation methods
- polygonal approximation