2026-08-06T10:40:23Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:23505 2025-10-02T12:57:09Z ddc:004 open_access

3.415-Approximation for Coflow Scheduling via Iterated Rounding Rohwedder, Lars Schnaars, Leander Coflow Scheduling Approximation Algorithms Iterated Rounding We provide an algorithm giving a 140/41 (< 3.415)-approximation for Coflow Scheduling and a 4.36-approximation for Coflow Scheduling with release dates. This improves upon the best known 4- and respectively 5-approximations and addresses an open question posed by Agarwal, Rajakrishnan, Narayan, Agarwal, Shmoys, and Vahdat [Agarwal et al., 2018], Fukunaga [Fukunaga, 2022], and others. We additionally show that in an asymptotic setting, the algorithm achieves a (2+ε)-approximation, which is essentially optimal under ℙ ≠ NP. The improvements are achieved using a novel edge allocation scheme using iterated LP rounding together with a framework which enables establishing strong bounds for combinations of several edge allocation algorithms. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Lars Rohwedder and Leander Schnaars 2025 Is Part Of LIPIcs, Volume 334, 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ICALP.2025.128 urn:nbn:de:0030-drops-235050 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.128 eng https://creativecommons.org/licenses/by/4.0/legalcode