k)-Approximation Algorithms for the Asymmetric k-Center Problem.
Aaron ArcherPublished in: IPCO (2001)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- network design problem
- worst case
- minimum cost
- np hardness
- open shop
- facility location problem
- exact algorithms
- set cover
- approximation ratio
- randomized algorithms
- primal dual
- disjoint paths
- combinatorial auctions
- undirected graph
- optimization problems
- constant factor
- polynomial time approximation