$A Distributed $(2+ε)$-Approximation for Vertex Cover in $O(\logΔ/ε\log\logΔ)$ Rounds$

v1v2 (latest)

A Distributed $(2+ε)$ -Approximation for Vertex Cover in $O(\logΔ/ε\log\logΔ)$ Rounds

11 February 2016

K. Censor-Hillel

Gregory Schwartzman

ArXiv (abs)PDF HTML

Papers citing "A Distributed $(2+ε)$-Approximation for Vertex Cover in $O(\logΔ/ε\log\logΔ)$ Rounds"

5 / 5 papers shown

Title
Optimal Distributed Covering Algorithms Ran Ben-Basat G. Even Ken-ichi Kawarabayashi Gregory Schwartzman 35 13 0 25 Feb 2019
$A Deterministic Distributed $2$-Approximation for Weighted Vertex Cover in $O(\log n\logΔ/ \log^2\logΔ)$ Rounds$ A Deterministic Distributed $2$ -Approximation for Weighted Vertex Cover in $O(\log n\logΔ/ \log^2\logΔ)$ Rounds Ran Ben-Basat G. Even Ken-ichi Kawarabayashi Gregory Schwartzman 36 4 0 04 Apr 2018
Fast Distributed Approximation for Max-Cut K. Censor-Hillel Rina Levy H. Shachnai 67 10 0 26 Jul 2017
A Time Hierarchy Theorem for the LOCAL Model Yi-Jun Chang Seth Pettie 52 102 0 20 Apr 2017
Distributed $(Δ+1)$ -Coloring in Sublogarithmic Rounds David G. Harris Johannes Schneider Hsin-Hao Su OOD 58 11 0 04 Mar 2016