π
π
The Cartographer
Constant round distributed domination on graph classes with bounded expansion
December 04, 2020 Β· Declared Dead Β· π Colloquium on Structural Information & Communication Complexity
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Simeon Kublenz, Sebastian Siebertz, Alexandre Vigny
arXiv ID
2012.02701
Category
cs.DS: Data Structures & Algorithms
Cross-listed
cs.DC,
cs.DM
Citations
7
Venue
Colloquium on Structural Information & Communication Complexity
Last Checked
4 months ago
Abstract
We show that the dominating set problem admits a constant factor approximation in a constant number of rounds in the LOCAL model of distributed computing on graph classes with bounded expansion. This generalizes a result of Czygrinow et al. for graphs with excluded topological minors.
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