A (2 + ε )-approximation algorithm for preemptive weighted flow time on a single machine

DOI10.1145/3406325.3451075arXiv2011.05676OpenAlexW3168487205MaRDI QIDQ6065230

Lars Rohwedder, Andreas Wiese

Publication date: 14 November 2023

Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

schedulingdynamic programmingapproximation algorithm

Mathematics Subject Classification ID

Theory of computing (68Qxx)

This page was built for publication: A (2 + ε )-approximation algorithm for preemptive weighted flow time on a single machine