An Improved Approximation Algorithm for Knapsack Median Using Sparsification.
Jaroslaw ByrkaThomas W. PensylBartosz RybickiJoachim SpoerhaseAravind SrinivasanKhoa TrinhPublished in: Algorithmica (2018)
Keyphrases
- dynamic programming
- experimental evaluation
- matching algorithm
- preprocessing
- optimal solution
- computational complexity
- theoretical analysis
- computational cost
- approximation ratio
- optimization algorithm
- detection algorithm
- particle swarm optimization
- learning algorithm
- knapsack problem
- recognition algorithm
- objective function
- cost function
- k means
- search space
- closed form
- input data
- times faster
- error bounds
- weighted distance
- greedy heuristic
- tree structure
- computationally efficient
- expectation maximization
- optimization problems
- high accuracy
- search algorithm
- video sequences
- decision trees