no code implementations • 8 Feb 2021 • Magnús M. Halldórsson, Alexandre Nolin
We present a procedure for efficiently sampling colors in the {\congest} model.
Distributed, Parallel, and Cluster Computing Data Structures and Algorithms
no code implementations • 17 Dec 2020 • Magnús M. Halldórsson, Murilo S. de Lima
We present a unified adaptive strategy for uniform costs that yields the following improved results: (1) a 3/2-competitive randomized algorithm; (2) a 5/3-competitive deterministic algorithm if the dependency graph has no 2-components after some preprocessing, which has competitive ratio $3/2+\mathrm{O}(1/k)$ if the components obtained have size at least $k$; and (3) an exact algorithm for laminar families of intervals.
Data Structures and Algorithms
