no code implementations • 22 Sep 2020 • David G. Harris, Hsin-Hao Su, Hoa T. Vu
Barenboim and Elkin [PODC `08] gave a LOCAL algorithm that computes a $(2+\epsilon)\alpha$-forest decomposition using $O(\frac{\log n}{\epsilon})$ rounds.
Data Structures and Algorithms Distributed, Parallel, and Cluster Computing Combinatorics
no code implementations • 7 Aug 2020 • Brian Brubach, Nathaniel Grammel, David G. Harris, Aravind Srinivasan, Leonidas Tsepenekas, Anil Vullikanti
The main focus of this paper is radius-based (supplier) clustering in the two-stage stochastic setting with recourse, where the inherent stochasticity of the model comes in the form of a budget constraint.
Data Structures and Algorithms
