v1v2 (latest)

Beyond Alice and Bob: Improved Inapproximability for Maximum Independent Set in CONGEST

ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2020

16 March 2020

Papers citing "Beyond Alice and Bob: Improved Inapproximability for Maximum Independent Set in CONGEST"

3 / 3 papers shown

231

14 Feb 2024

The Message Complexity of Distributed Graph OptimizationInformation Technology Convergence and Services (ITCS), 2023

193

24 Nov 2023

$Narrowing the LOCAL$\unicode{x2013}$CONGEST Gaps in Sparse Networks via Expander Decompositions$

\unicode{x2013}

CONGEST Gaps in Sparse Networks via Expander DecompositionsACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2022

244

17 May 2022