Approximation Algorithms for the k-center Problem: An Experimental Evaluation.
Jurij MihelicBorut RobicPublished in: OR (2002)
Keyphrases
- approximation algorithms
- experimental evaluation
- np hard
- special case
- worst case
- vertex cover
- minimum cost
- network design problem
- facility location problem
- primal dual
- approximation schemes
- set cover
- randomized algorithms
- undirected graph
- np hardness
- approximation ratio
- precedence constraints
- lower bound
- job shop scheduling
- traveling salesman problem
- constant factor
- scheduling problem
- open shop
- disjoint paths