An O(log* n) Approximation Algorithm for the Asymmetric p-Center Problem.
Sundar VishwanathanPublished in: SODA (1996)
Keyphrases
- preprocessing
- np hard
- times faster
- computational complexity
- experimental evaluation
- learning algorithm
- simulated annealing
- approximation ratio
- improved algorithm
- computationally efficient
- worst case
- probabilistic model
- significant improvement
- search space
- objective function
- dynamic programming
- k means
- high accuracy
- linear programming
- optimal solution
- similarity measure
- closed form
- neural network
- cost function
- approximation algorithms
- matching algorithm
- classification algorithm
- detection algorithm
- segmentation algorithm
- search algorithm