Approximation Algorithms for the Vertex K-Center Problem: Survey and Experimental Evaluation.
Jesus Garcia-DiazRolando Menchaca-MéndezRicardo Menchaca-MendezSaúl E. Pomares HernándezJulio Cesar Perez SansalvadorNoureddine LakouariPublished in: IEEE Access (2019)
Keyphrases
- approximation algorithms
- experimental evaluation
- undirected graph
- np hard
- special case
- minimum cost
- vertex cover
- worst case
- facility location problem
- exact algorithms
- constant factor
- primal dual
- set cover
- network design problem
- disjoint paths
- open shop
- np hardness
- randomized algorithms
- polynomial time approximation
- combinatorial auctions
- approximation schemes
- precedence constraints
- genetic algorithm
- directed graph
- lower bound
- computational complexity