Approximation algorithms for problems in scheduling with set-ups.

Srikrishnan Divakaran Michael E. Saks

Published in: Discret. Appl. Math. (2008)

Keyphrases

approximation algorithms
minimum cost
vertex cover
special case
set cover
np hard
np complete
approximation schemes
exact algorithms
np hardness
randomized algorithms
worst case
precedence constraints
approximation ratio
finite number
resource constraints
primal dual
network design problem
production scheduling