Login / Signup

A Framework for Designing Approximation Algorithms for Scheduling Problems.

Roberto Solis-Oba
Published in: WEA (2003)
Keyphrases
  • approximation algorithms
  • np hard
  • scheduling problem
  • special case
  • set cover
  • worst case
  • minimum cost
  • network design problem
  • lower bound
  • single machine
  • precedence constraints