Asymptotically Optimal Approximation Algorithms for Coflow Scheduling.
Hamidreza JahanjouErez KantorRajmohan RajaramanPublished in: SPAA (2017)
Keyphrases
- approximation algorithms
- asymptotically optimal
- precedence constraints
- np hard
- asymptotic optimality
- scheduling problem
- special case
- worst case
- vertex cover
- heavy traffic
- arrival rate
- approximation ratio
- scheduling algorithm
- resource allocation
- open shop
- parallel machines
- round robin
- call center
- optimal policy
- randomized algorithms
- search algorithm
- combinatorial auctions
- job shop
- polynomial time approximation
- linear programming
- multi dimensional
- disjoint paths