A Polynomial Time Constant Approximation For Minimizing Total Weighted Flow-time
From MaRDI portal
Publication:5236280
DOI10.1137/1.9781611975482.96zbMath1431.68153arXiv1807.09885OpenAlexW2952691133MaRDI QIDQ5236280
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
Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)
Related Items (5)
Minimizing the maximum flow time in the online food delivery problem ⋮ Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time ⋮ Fair Scheduling via Iterative Quasi-Uniform Sampling ⋮ The online food delivery problem on stars ⋮ Constant Factor Approximation Algorithm for Weighted Flow-Time on a Single Machine in PseudoPolynomial Time
This page was built for publication: A Polynomial Time Constant Approximation For Minimizing Total Weighted Flow-time
