Approximation Guarantees for Deterministic Maximization of Submodular Function with a Matroid Constraint.

Xin Sun Dachuan Xu Longkun Guo Min Li

Published in: TAMC (2020)

Keyphrases

approximation guarantees
greedy algorithm
submodular functions
objective function
worst case
greedy algorithms
dynamic programming
knapsack problem
machine learning
learning algorithm
image segmentation
np hard
supervised learning
linear programming