Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms.
Fangfang WuZhongyi JiangRun ZhangXiandong ZhangPublished in: J. Sched. (2023)
Keyphrases
- approximation algorithms
- np hard
- special case
- precedence constraints
- worst case
- minimum cost
- vertex cover
- facility location problem
- network design problem
- set cover
- scheduling problem
- np hardness
- scheduling algorithm
- randomized algorithms
- primal dual
- undirected graph
- approximation ratio
- constant factor
- approximation guarantees
- open shop