Parallel Approximation Algorithms for Facility-Location Problems
Guy E. BlellochKanat TangwongsanPublished in: CoRR (2010)
Keyphrases
- approximation algorithms
- facility location problem
- np hard
- special case
- worst case
- vertex cover
- minimum cost
- open shop
- randomized algorithms
- precedence constraints
- network design problem
- approximation ratio
- disjoint paths
- set cover
- shared memory
- approximation guarantees
- dynamic programming
- computational complexity
- genetic algorithm