Asymptotically Optimal Approximation Algorithms for Coflow Scheduling.
Hamidreza JahanjouErez KantorRajmohan RajaramanPublished in: CoRR (2016)
Keyphrases
- approximation algorithms
- asymptotically optimal
- precedence constraints
- np hard
- asymptotic optimality
- special case
- scheduling problem
- worst case
- arrival rate
- vertex cover
- randomized algorithms
- heavy traffic
- optimal policy
- open shop
- approximation ratio
- scheduling algorithm
- resource allocation
- holding cost
- disjoint paths
- round robin
- constant factor
- job shop
- combinatorial auctions
- response time
- constant factor approximation