The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs

2 May 2023

Papers citing "The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs"

4 / 4 papers shown

Title
$Narrowing the LOCAL$\unicode{x2013}$CONGEST Gaps in Sparse Networks via Expander Decompositions$ Narrowing the LOCAL $\unicode{x2013}$ CONGEST Gaps in Sparse Networks via Expander Decompositions Yi-Jun Chang Hsin-Hao Su 37 10 0 17 May 2022
Lower Bounds for Induced Cycle Detection in Distributed Computing Franccois Le Gall Masayuki Miyamoto 24 6 0 02 Oct 2021
Fast Distributed Approximation for Max-Cut K. Censor-Hillel Rina Levy H. Shachnai 37 10 0 26 Jul 2017
No Sublogarithmic-time Approximation Scheme for Bipartite Vertex Cover Mika Göös Jukka Suomela 32 12 0 21 May 2012