Improved Approximations for Coflow Scheduling via Iterated Rounding and Stable Matchings
Mikhail Cherniavskii, Arseni Fedorovich, Mikhail Koshelev, Andrey Kupavskii, Stanislav Moiseev, Fedor Ozhegov, Alexander Shekhovtsov
Abstract
We study Coflow Scheduling, introduced by Chowdhury, Zhong, and Stoica (2014). We give deterministic polynomial-time algorithms achieving a 2.77-approximation without release dates and a 3.17-approximation with integer release dates. These improve the 3.42 and 4.36 guarantees of Rohwedder and Schnaars (2025). Our approach combines two ideas: (1) a novel iterated rounding scheme, and (2) Galvin's list edge coloring method, which is based on the Gale--Shapley stable matching algorithm.
Create a lesson
Related papers
Distributed (Δ+1)-Coloring in O(Δ+* n) Rounds
Marc Fuchs, Fabian Kuhn
Ramsey Meets Simultaneous Planarity: Vertex Integrity and Pathwidth
Thomas Depian, Simon D. Fink, Alexander Firbas et al.
Hashrope: A Persistent Data Structure for Mechanisms of LLM Context Management
Muntaser Syed, Ameerah Alsulami, Marius Silaghi
Approximation algorithms via discrepancy with hard constraints
Mikhail Cherniavskii, Andrey Kupavskii, Stanislav Moiseev et al.
Online Submodular Welfare Maximization: Computation is not the Bottleneck
Rajan Udwani, David Wajc
Stochastic Weighted Caching with Per-Request Predictions
Shuchi Chawla, Dimitris Christou