A Polynomial Time Constant Approximation For Minimizing Total Weighted Flow-time.
Uriel FeigeJanardhan KulkarniShi LiPublished in: SODA (2019)
Keyphrases
- completion times
- approximation algorithms
- approximation ratio
- min cost
- constant factor
- weight function
- convex functions
- absolute deviation
- weighted sum
- special case
- computational complexity
- scheduling problem
- single machine
- max flow
- axis parallel
- relative error
- satisfy the triangle inequality
- single machine scheduling problem
- np hard
- error bounds
- polynomial time approximation
- approximation schemes
- closed form
- worst case
- decreasing function
- neural network
- piecewise constant
- queue length
- randomized algorithm
- flow field
- total energy
- search algorithm