A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack Constraint.
Alina EneHuy L. NguyenPublished in: ICALP (2019)
Keyphrases
- dynamic programming
- objective function
- experimental evaluation
- learning algorithm
- optimal solution
- cost function
- computational complexity
- k means
- optimization algorithm
- segmentation algorithm
- computationally efficient
- times faster
- detection algorithm
- high accuracy
- worst case
- computational cost
- improved algorithm
- matching algorithm
- decision trees
- knapsack problem
- recognition algorithm
- expectation maximization
- np hard
- preprocessing
- similarity measure
- clustering method
- tree structure
- upper bound
- convex hull
- constrained minimization