Approximation algorithms for multiprocessor scheduling under uncertainty.
Guolong LinRajmohan RajaramanPublished in: SPAA (2007)
Keyphrases
- approximation algorithms
- special case
- np hard
- vertex cover
- worst case
- minimum cost
- primal dual
- network design problem
- set cover
- facility location problem
- randomized algorithms
- exact algorithms
- approximation schemes
- disjoint paths
- open shop
- approximation ratio
- np hardness
- undirected graph
- search algorithm
- strongly np hard
- learning algorithm