π
π
The Cartographer
P-SLOCAL-Completeness of Maximum Independent Set Approximation
July 24, 2019 Β· Declared Dead Β· π ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Yannic Maus
arXiv ID
1907.10499
Category
cs.DS: Data Structures & Algorithms
Cross-listed
cs.DC
Citations
0
Venue
ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing
Last Checked
5 months ago
Abstract
We prove that the maximum independent set approximation problem with polylogarithmic approximation factor is P-SLOCAL-complete. Thus an efficient algorithm for the maximum independent set approximation in the LOCAL model implies efficient algorithms for many problems in the LOCAL model including the computation of (polylog n, polylog n) network decompositions.
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