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

We present a simple deterministic distributed (2 + ϵ)-approximation algorithm for minimum-weight vertex cover, which completes in O (log Δ/ϵlog log Δ) rounds, where Δ is the maximum degree in the graph, for any ϵ > 0 that is at most O (1). For a constant ϵ, this implies a constant approximation i...

Full description

Saved in:
Bibliographic Details
Published in:Journal of the ACM 2017-06, Vol.64 (3), p.1-11
Main Authors: Bar-Yehuda, Reuven, Censor-Hillel, Keren, Schwartzman, Gregory
Format: Article
Language:English
Subjects:
Algorithms
Approximation
Graph theory
Graphs
Mathematical analysis
Studies
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We present a simple deterministic distributed (2 + ϵ)-approximation algorithm for minimum-weight vertex cover, which completes in O (log Δ/ϵlog log Δ) rounds, where Δ is the maximum degree in the graph, for any ϵ > 0 that is at most O (1). For a constant ϵ, this implies a constant approximation in O (log Δ/log log Δ) rounds, which contradicts the lower bound of [KMW10].
ISSN:0004-5411
1557-735X
DOI:10.1145/3060294