Deterministic approximation algorithm for submodular maximization subject to a matroid constraint.
Xin SunDachuan XuLongkun GuoMin LiPublished in: Theor. Comput. Sci. (2021)
Keyphrases
- objective function
- greedy algorithm
- experimental evaluation
- detection algorithm
- np hard
- times faster
- optimization algorithm
- learning algorithm
- recognition algorithm
- worst case
- k means
- search space
- preprocessing
- approximation ratio
- approximation guarantees
- submodular functions
- conjugate gradient algorithm
- convex hull
- theoretical analysis
- matching algorithm
- optimal solution
- combinatorial optimization
- clustering method
- linear programming
- high accuracy
- cost function
- randomized algorithm
- similarity measure
- image sequences