A deterministic distributed 2-approximation for weighted vertex cover in O(Log N log Δ/ log 2 log Δ) rounds

Ran Ben-Basat, Guy Even, Ken Ichi Kawarabayashi, Gregory Schwartzman

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We present a deterministic distributed 2-approximation algorithm for the Minimum Weight Vertex Cover problem in the CON-GEST model whose round complexity is O(log n log Δ/ log 2 log Δ). This improves over the currently best known deterministic 2-approximation implied by [KVY94]. Our solution generalizes the (2 + ɛ)-approximation algorithm of [BCS17], improving the dependency on ɛ −1 from linear to logarithmic. In addition, for every ɛ = (logΔ) −c , where c ≥ 1 is a constant, our algorithm computes a (2 + ɛ)-approximation in O(log Δ/ log log Δ) rounds (which is asymptotically optimal).

Original languageEnglish
Title of host publication25th International Colloquium, SIROCCO 2018, Revised Selected Papers
EditorsZvi Lotker, Boaz Patt-Shamir
PublisherSpringer Verlag
Pages226-236
Number of pages11
ISBN (Print)9783030013240
DOIs
StatePublished - 2018
Event25th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2018 - Ma’ale HaHamisha, Israel
Duration: 18 Jun 201821 Jun 2018

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11085
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference25th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2018
Country/TerritoryIsrael
CityMa’ale HaHamisha
Period18/06/1821/06/18

Fingerprint

Dive into the research topics of 'A deterministic distributed 2-approximation for weighted vertex cover in O(Log N log Δ/ log 2 log Δ) rounds'. Together they form a unique fingerprint.

Cite this