Approximation Algorithms for the 0-Extension Problem.
Gruia CalinescuHoward J. KarloffYuval RabaniPublished in: SIAM J. Comput. (2004)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- minimum cost
- facility location problem
- open shop
- approximation schemes
- constant factor
- set cover
- network design problem
- disjoint paths
- approximation ratio
- primal dual
- np hardness
- randomized algorithms
- exact algorithms
- combinatorial auctions
- lower bound