A Nearly-linear Time Algorithm for Submodular Maximization with a Knapsack Constraint.
Alina EneHuy L. NguyenPublished in: CoRR (2017)
Keyphrases
- objective function
- dynamic programming
- optimal solution
- learning algorithm
- cost function
- detection algorithm
- k means
- worst case
- improved algorithm
- knapsack problem
- theoretical analysis
- high accuracy
- experimental evaluation
- computational cost
- np hard
- optimization algorithm
- times faster
- preprocessing
- particle swarm optimization
- computationally efficient
- significant improvement
- search space
- expectation maximization
- graph cuts
- clustering method
- computational complexity
- space complexity