Approximation Algorithms for Scheduling on Multiple Machines.
V. S. Anil KumarMadhav V. MaratheSrinivasan ParthasarathyAravind SrinivasanPublished in: FOCS (2005)
Keyphrases
- approximation algorithms
- np hard
- precedence constraints
- special case
- vertex cover
- minimum cost
- worst case
- facility location problem
- primal dual
- parallel machines
- randomized algorithms
- approximation ratio
- scheduling problem
- scheduling algorithm
- constant factor
- set cover
- np hardness
- parallel processors
- network design problem
- undirected graph
- resource allocation
- genetic algorithm
- theoretical analysis
- feasible solution
- approximation schemes
- flowshop
- disjoint paths
- wafer fabrication