A Polynomial Time Constant Approximation For Minimizing Total Weighted Flow-time

DOI10.1137/1.9781611975482.96zbMath1431.68153arXiv1807.09885MaRDI QIDQ5236280

Uriel Feige, Shi Li, Janardhan Kulkarni

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1807.09885

Mathematics Subject Classification ID

68W40: Analysis of algorithms

90B35: Deterministic scheduling theory in operations research

68W25: Approximation algorithms