Distributed Approximation of Maximum Independent Set and Maximum Matching

1 August 2017

Gregory Schwartzman

Papers citing "Distributed Approximation of Maximum Independent Set and Maximum Matching"

26 / 26 papers shown

Title
Improved Deterministic Distributed Maximum Weight Independent Set Approximation in Sparse Graphs Yuval Gil 98 1 0 14 Feb 2024
The Message Complexity of Distributed Graph Optimization Fabien Dufoulon Shreyas Pai Gopal Pandurangan Sriram V. Pemmaraju Peter Robinson 69 6 0 24 Nov 2023
A Nearly Linear-Time Distributed Algorithm for Exact Maximum Matching Taisuke Izumi Naoki Kitamura Yutaro Yamaguchi 62 0 0 07 Nov 2023
Average Awake Complexity of MIS and Matching M. Ghaffari Julian Portmann 59 14 0 10 May 2023
The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs Yi-Jun Chang Zeyong Li 72 7 0 02 May 2023
$(1-ε)$ -Approximate Maximum Weighted Matching in Distributed, Parallel, and Semi-Streaming Settings Shang-En Huang Hsin-Hao Su 58 2 0 29 Dec 2022
Node and Edge Averaged Complexities of Local Graph Problems Alkida Balliu M. Ghaffari Fabian Kuhn Dennis Olivetti 71 7 0 17 Aug 2022
Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs Taisuke Izumi Naoki Kitamura Takamasa Naruse Gregory Schwartzman 54 6 0 30 May 2022
$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 104 10 0 17 May 2022
Distributed CONGEST Approximation of Weighted Vertex Covers and Matchings S. Faour Marc Fuchs Fabian Kuhn 46 11 0 20 Nov 2021
A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching Naoki Kitamura Taisuke Izumi 60 5 0 25 Apr 2021
Massively Parallel Correlation Clustering in Bounded Arboricity Graphs Mélanie Cambus Davin Choo Havu Miikonen Jara Uitto 70 15 0 23 Feb 2021
Approximate Bipartite Vertex Cover in the CONGEST Model S. Faour Fabian Kuhn 36 3 0 19 Nov 2020
Probably Approximately Knowing Nitzan Zamir Yoram Moses 16 0 0 06 Jul 2020
Beyond Alice and Bob: Improved Inapproximability for Maximum Independent Set in CONGEST Yuval Efron O. Grossman Seri Khoury 109 6 0 16 Mar 2020
Distributed Maximum Matching Verification in CONGEST Mohamad Ahmadi Fabian Kuhn 67 8 0 18 Feb 2020
A Breezing Proof of the KMW Bound Corinna Coupette Christoph Lenzen 82 5 0 14 Feb 2020
Improved Distributed Approximations for Maximum Independent Set Ken-ichi Kawarabayashi Seri Khoury Aaron Schild Gregory Schwartzman 50 9 0 27 Jun 2019
Hardness of Distributed Optimization Nir Bachrach K. Censor-Hillel Michal Dory Yuval Efron Dean Leitersdorf A. Paz 56 41 0 24 May 2019
Optimal Distributed Covering Algorithms Ran Ben-Basat G. Even Ken-ichi Kawarabayashi Gregory Schwartzman 43 13 0 25 Feb 2019
Smaller Cuts, Higher Lower Bounds Amir Abboud K. Censor-Hillel Seri Khoury A. Paz 68 29 0 07 Jan 2019
Optimal Distributed Weighted Set Cover Approximation Ran Ben-Basat G. Even Ken-ichi Kawarabayashi Gregory Schwartzman 31 1 0 17 Aug 2018
Parameterized Distributed Algorithms Ran Ben-Basat Ken-ichi Kawarabayashi Gregory Schwartzman 63 14 0 13 Jul 2018
Adapting Local Sequential Algorithms to the Distributed Setting Ken-ichi Kawarabayashi Gregory Schwartzman 47 3 0 28 Nov 2017
A Faster Distributed Single-Source Shortest Paths Algorithm Sebastian Krinninger Danupon Nanongkai 83 66 0 03 Nov 2017
Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model K. Censor-Hillel Seri Khoury A. Paz 75 55 0 16 May 2017