The Speedup of Parallel Randomized Approximation Algorithms.
Gardiner S. StilesF. H. LeeC. GyulaiViswanathan SwaminathanPublished in: PDPTA (1996)
Keyphrases
- approximation algorithms
- randomized algorithms
- np hard
- special case
- minimum cost
- facility location problem
- network design problem
- vertex cover
- np hardness
- worst case
- set cover
- approximation schemes
- constant factor
- precedence constraints
- primal dual
- open shop
- exact algorithms
- approximation ratio
- disjoint paths
- shared memory