Login / Signup

Approximation algorithms for scheduling with a limited number of communications.

Chams Lahlou
Published in: Parallel Comput. (2000)
Keyphrases
  • approximation algorithms
  • special case
  • np hard
  • constant factor
  • scheduling problem
  • worst case
  • vertex cover
  • minimum cost
  • undirected graph
  • network design problem
  • computational complexity
  • parallel machines
  • open shop