Login / Signup

Fast approximation algorithms for job scheduling with processing set restrictions.

Yumei HuoJoseph Y.-T. Leung
Published in: Theor. Comput. Sci. (2010)
Keyphrases
  • approximation algorithms
  • set cover
  • job scheduling
  • minimum cost
  • np hard
  • special case
  • worst case
  • primal dual