An Improved Approximation Algorithm for the Hard Uniform Capacitated k-median Problem.
Shanfei LiPublished in: APPROX-RANDOM (2014)
Keyphrases
- np hard
- experimental evaluation
- learning algorithm
- optimization algorithm
- k means
- dynamic programming
- times faster
- computational complexity
- error bounds
- computational cost
- detection algorithm
- high accuracy
- expectation maximization
- benchmark problems
- knapsack problem
- convergence rate
- worst case
- search space
- preprocessing
- probabilistic model
- combinatorial optimization
- cost function
- greedy algorithm
- significant improvement
- network flow
- single source
- weighted distance
- uniform sampling