Improved Approximation Algorithms for Minimizing the Total Weighted Completion Time of Coflows.
Chi-Yeh ChenPublished in: CoRR (2023)
Keyphrases
- approximation algorithms
- np hard
- special case
- scheduling problem
- facility location problem
- worst case
- minimum cost
- vertex cover
- single machine
- precedence constraints
- network design problem
- approximation schemes
- approximation ratio
- set cover
- primal dual
- np hardness
- processing times
- release dates
- undirected graph
- randomized algorithms
- constant factor approximation
- open shop
- lower bound
- approximation guarantees
- search space