Approximation algorithms for power minimization of earliest deadline first and rate monotonic schedules.
Sushu ZhangKaram S. ChathaGoran KonjevodPublished in: ISLPED (2007)
Keyphrases
- approximation algorithms
- special case
- np hard
- minimum cost
- vertex cover
- scheduling problem
- worst case
- open shop
- network design problem
- approximation ratio
- np hardness
- facility location problem
- disjoint paths
- objective function
- set cover
- primal dual
- scheduling algorithm
- approximation schemes
- randomized algorithms
- exact algorithms
- constant factor