Efficient Approximation Algorithms for Scheduling Malleable Tasks.
Grégory MouniéChristophe RapineDenis TrystramPublished in: SPAA (1999)
Keyphrases
- approximation algorithms
- np hard
- special case
- vertex cover
- precedence constraints
- minimum cost
- facility location problem
- scheduling problem
- worst case
- approximation ratio
- primal dual
- disjoint paths
- network design problem
- undirected graph
- randomized algorithms
- approximation schemes
- open shop
- combinatorial auctions
- np hardness
- linear programming
- lower bound
- constant factor
- objective function
- genetic algorithm