When a worse approximation factor gives better performance: a 3-approximation algorithm for the vertex k-center problem.
Jesus Garcia-DiazJairo Javier Sanchez-HernandezRicardo Menchaca-MendezRolando Menchaca-MéndezPublished in: J. Heuristics (2017)
Keyphrases
- np hard
- high accuracy
- k means
- experimental evaluation
- learning algorithm
- approximation ratio
- optimization algorithm
- preprocessing
- dynamic programming
- increase in computational complexity
- hamiltonian cycle
- detection algorithm
- computational cost
- cost function
- optimal solution
- polynomial time approximation
- polygonal approximation
- approximation algorithms
- error bounds
- times faster
- neural network
- similarity measure
- objective function
- approximation methods
- efficient computation
- clustering method
- theoretical analysis
- simulated annealing
- search space
- significant improvement
- closed form
- matching algorithm
- piecewise constant
- computational complexity
- error tolerance
- worst case
- discrete random variables