Scheduling with communication delay in near-linear time

DOI10.4230/LIPICS.STACS.2022.47MaRDI QIDQ6490993zbMATH OpenFDO

Authors Quanquan C. Liu, Manish Purohit, Zoya Svitkina, Erik Vee, Joshua R. Wang

Publication date 23 April 2024

Full work available at URL https://doi.org/10.4230/LIPICS.STACS.2022.47

zbMATH Keywords

graph algorithmsnear-linear time schedulingprecedence-constrained jobsscheduling with duplication

Mathematics Subject Classification ID

Theory of computing (68Qxx)

This page was built for publication: Scheduling with communication delay in near-linear time

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