A constant approximation algorithm for the one-warehouse multi-retailer problem.
Retsef LeviRobin RoundyDavid B. ShmoysPublished in: SODA (2005)
Keyphrases
- learning algorithm
- worst case
- detection algorithm
- improved algorithm
- cost function
- dynamic programming
- similarity measure
- preprocessing
- matching algorithm
- computational cost
- k means
- theoretical analysis
- error tolerance
- monte carlo
- optimization algorithm
- computationally efficient
- input data
- np hard
- significant improvement
- computational complexity
- expectation maximization
- simulated annealing
- search space
- closed form
- approximation ratio
- neural network