Competitive flow time algorithms for polyhedral scheduling

DOI10.1109/FOCS.2015.38MaRDI QIDQ6946874zbMATH OpenFDO

Authors Sungjin Im, Janardhan Kulkarni, Kamesh Munagala

Publication date 5 August 2025

Full work available at URL https://doi.org/10.1109/FOCS.2015.38

Mathematics Subject Classification ID

Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cited in

(2)

• Online two-dimensional load balancing
• The power of proportional fairness for nonclairvoyant polytope scheduling

This page was built for publication: Competitive flow time algorithms for polyhedral scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6946874)