A distributed (2 + ∈)-approximation for vertex cover in O(logΔ/∈ log log Δ) rounds

Reuven Bar-Yehuda; Keren Censor-Hillel; Gregory Schwartzman

doi:10.1145/3060294

A distributed (2 + ∈)-approximation for vertex cover in O(logΔ/∈ log log Δ) rounds

Reuven Bar-Yehuda, Keren Censor-Hillel, Gregory Schwartzman

Computer Science

Technion - Israel Institute of Technology

Research output: Contribution to journal › Article › peer-review

Abstract

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].

Original language	English
Article number	23
Journal	Journal of the ACM
Volume	64
Issue number	3
DOIs	https://doi.org/10.1145/3060294
State	Published - Jun 2017

Keywords

Approximation algorithms
Distributed computing
Graph algorithms
Localratio
Vertex cover

All Science Journal Classification (ASJC) codes

Software
Control and Systems Engineering
Information Systems
Hardware and Architecture
Artificial Intelligence

Access to Document

10.1145/3060294

Cite this

@article{8b998aac73094a498adced29ba37f6f2,

title = "A distributed (2 + ∈)-approximation for vertex cover in O(logΔ/∈ log log Δ) rounds",

abstract = "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].",

keywords = "Approximation algorithms, Distributed computing, Graph algorithms, Localratio, Vertex cover",

author = "Reuven Bar-Yehuda and Keren Censor-Hillel and Gregory Schwartzman",

note = "Publisher Copyright: {\textcopyright} 2017 ACM.",

year = "2017",

month = jun,

doi = "10.1145/3060294",

language = "الإنجليزيّة",

volume = "64",

journal = "Journal of the ACM",

issn = "0004-5411",

publisher = "Association for Computing Machinery (ACM)",

number = "3",

}

TY - JOUR

T1 - A distributed (2 + ∈)-approximation for vertex cover in O(logΔ/∈ log log Δ) rounds

AU - Bar-Yehuda, Reuven

AU - Censor-Hillel, Keren

AU - Schwartzman, Gregory

PY - 2017/6

Y1 - 2017/6

N2 - 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].

AB - 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].

KW - Approximation algorithms

KW - Distributed computing

KW - Graph algorithms

KW - Localratio

KW - Vertex cover

UR - http://www.scopus.com/inward/record.url?scp=85021069838&partnerID=8YFLogxK

U2 - 10.1145/3060294

DO - 10.1145/3060294

M3 - مقالة

SN - 0004-5411

VL - 64

JO - Journal of the ACM

JF - Journal of the ACM

IS - 3

M1 - 23

ER -

A distributed (2 + ∈)-approximation for vertex cover in O(logΔ/∈ log log Δ) rounds

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this