Approximation algorithms for scheduling trees with general communication delays.
Alix MunierPublished in: Parallel Comput. (1999)
Keyphrases
- approximation algorithms
- communication delays
- special case
- np hard
- precedence constraints
- precedence relations
- scheduling problem
- minimum cost
- worst case
- vertex cover
- approximation ratio
- execution times
- control theory
- multiprocessor systems
- polynomially solvable
- np complete
- constant factor
- release dates
- resource constrained project scheduling problem
- processing times
- differential equations
- branch and bound algorithm