-
Tight Bounds for Deterministic High-Dimensional Grid Exploration
We study the problem of exploring an oriented grid with autonomous agent...
05/26/2020 ∙ by Sebastian Brandt, et al. ∙
0
∙
share
read it
-
k-means++: few more steps yield constant approximation
The k-means++ algorithm of Arthur and Vassilvitskii (SODA 2007) is a sta...
02/18/2020 ∙ by Davin Choo, et al. ∙
0
∙
share
read it
-
Improved Network Decompositions using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond
Network decompositions, as introduced by Awerbuch, Luby, Goldberg, and P...
08/09/2019 ∙ by Mohsen Ghaffari, et al. ∙
0
∙
share
read it
