π
π
The Cartographer
A Simple Deterministic Distributed Low-Diameter Clustering
October 21, 2022 Β· Declared Dead Β· π SIAM Symposium on Simplicity in Algorithms
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
VΓ‘clav RozhoΕ, Bernhard Haeupler, Christoph Grunau
arXiv ID
2210.11784
Category
cs.DS: Data Structures & Algorithms
Cross-listed
cs.DC
Citations
1
Venue
SIAM Symposium on Simplicity in Algorithms
Last Checked
4 months ago
Abstract
We give a simple, local process for nodes in an undirected graph to form non-adjacent clusters that (1) have at most a polylogarithmic diameter and (2) contain at least half of all vertices. Efficient deterministic distributed clustering algorithms for computing strong-diameter network decompositions and other key tools follow immediately. Overall, our process is a direct and drastically simplified way for computing these fundamental objects.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Data Structures & Algorithms
R.I.P.
π»
Ghosted
Route Planning in Transportation Networks
R.I.P.
π»
Ghosted
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
R.I.P.
π»
Ghosted
Hierarchical Clustering: Objective Functions and Algorithms
R.I.P.
π»
Ghosted
Graph Isomorphism in Quasipolynomial Time
π
π
The Cartographer
Simulation optimization: A review of algorithms and applications
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted