A Polynomial Time Constant Approximation For Minimizing Total Weighted Flow-time.
Uriel FeigeJanardhan KulkarniShi LiPublished in: CoRR (2018)
Keyphrases
- approximation algorithms
- completion times
- approximation ratio
- min cost
- special case
- constant factor
- weight function
- worst case
- polynomial time approximation
- satisfy the triangle inequality
- np hard
- scheduling problem
- closed form
- single machine
- absolute deviation
- min sum
- weighted sum
- approximation error
- neural network
- integrality gap
- approximation schemes
- single machine scheduling problem
- lp norm
- convex functions
- learning algorithm
- arbitrarily close
- computational complexity
- total weight
- error bounds
- low degree
- np hardness
- finite automata
- flow patterns
- weighted graph
- max flow
- randomized algorithm
- axis parallel
- flowshop
- processing times
- network flow