2 papers
cs.DS2026
Improved Approximations for Coflow Scheduling via Iterated Rounding and Stable Matchings
Mikhail Cherniavskii, Arseni Fedorovich, Mikhail Koshelev +4
We study Coflow Scheduling, introduced by Chowdhury, Zhong, and Stoica (2014). We give deterministic polynomial-time algorithms achieving a -approximation without release dat…
math.CO2026
Ordinary and measurable colorings of Euclidean three-space
Mikhail Koshelev, Andrey Kupavskii, Vsevolod Voronov
A proper coloring of Euclidean space is a coloring that assigns different colors to points at distance one. Using the planar character-law rigidity theorem of OpenAI, we prove that…