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

doi:10.1007/978-3-030-01325-7_21

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

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

School of Electrical Engineering

Tel Aviv University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 ² 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 ɛ ⁻¹ 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 language	English
Title of host publication	25th International Colloquium, SIROCCO 2018, Revised Selected Papers
Editors	Zvi Lotker, Boaz Patt-Shamir
Publisher	Springer Verlag
Pages	226-236
Number of pages	11
ISBN (Print)	9783030013240
DOIs	https://doi.org/10.1007/978-3-030-01325-7_21
State	Published - 2018
Event	25th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2018 - Ma’ale HaHamisha, Israel Duration: 18 Jun 2018 → 21 Jun 2018

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	11085

Conference

Conference	25th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2018
Country/Territory	Israel
City	Ma’ale HaHamisha
Period	18/06/18 → 21/06/18

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-030-01325-7_21

Cite this

Ben-Basat, R., Even, G., Kawarabayashi, K. I., & Schwartzman, G. (2018). A deterministic distributed 2-approximation for weighted vertex cover in O(Log N log Δ/ log ² log Δ) rounds. In Z. Lotker, & B. Patt-Shamir (Eds.), 25th International Colloquium, SIROCCO 2018, Revised Selected Papers (pp. 226-236). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11085). Springer Verlag. https://doi.org/10.1007/978-3-030-01325-7_21

Ben-Basat, Ran ; Even, Guy ; Kawarabayashi, Ken Ichi et al. / A deterministic distributed 2-approximation for weighted vertex cover in O(Log N log Δ/ log ² log Δ) rounds. 25th International Colloquium, SIROCCO 2018, Revised Selected Papers. editor / Zvi Lotker ; Boaz Patt-Shamir. Springer Verlag, 2018. pp. 226-236 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{e052a5b7d7f24fdaaef287adfbac7b6e,

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

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).",

author = "Ran Ben-Basat and Guy Even and Kawarabayashi, \{Ken Ichi\} and Gregory Schwartzman",

note = "Publisher Copyright: {\textcopyright} Springer Nature Switzerland AG 2018.; 25th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2018 ; Conference date: 18-06-2018 Through 21-06-2018",

year = "2018",

doi = "10.1007/978-3-030-01325-7\_21",

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

isbn = "9783030013240",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "226--236",

editor = "Zvi Lotker and Boaz Patt-Shamir",

booktitle = "25th International Colloquium, SIROCCO 2018, Revised Selected Papers",

address = "ألمانيا",

}

Ben-Basat, R, Even, G, Kawarabayashi, KI & Schwartzman, G 2018, A deterministic distributed 2-approximation for weighted vertex cover in O(Log N log Δ/ log ² log Δ) rounds. in Z Lotker & B Patt-Shamir (eds), 25th International Colloquium, SIROCCO 2018, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11085, Springer Verlag, pp. 226-236, 25th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2018, Ma’ale HaHamisha, Israel, 18/06/18. https://doi.org/10.1007/978-3-030-01325-7_21

A deterministic distributed 2-approximation for weighted vertex cover in O(Log N log Δ/ log ² log Δ) rounds. / Ben-Basat, Ran; Even, Guy; Kawarabayashi, Ken Ichi et al.
25th International Colloquium, SIROCCO 2018, Revised Selected Papers. ed. / Zvi Lotker; Boaz Patt-Shamir. Springer Verlag, 2018. p. 226-236 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11085).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

AU - Ben-Basat, Ran

AU - Even, Guy

AU - Kawarabayashi, Ken Ichi

AU - Schwartzman, Gregory

PY - 2018

Y1 - 2018

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

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

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

U2 - 10.1007/978-3-030-01325-7_21

DO - 10.1007/978-3-030-01325-7_21

M3 - منشور من مؤتمر

SN - 9783030013240

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 226

EP - 236

BT - 25th International Colloquium, SIROCCO 2018, Revised Selected Papers

A2 - Lotker, Zvi

A2 - Patt-Shamir, Boaz

PB - Springer Verlag

T2 - 25th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2018

Y2 - 18 June 2018 through 21 June 2018

ER -

Ben-Basat R, Even G, Kawarabayashi KI, Schwartzman G. A deterministic distributed 2-approximation for weighted vertex cover in O(Log N log Δ/ log ² log Δ) rounds. In Lotker Z, Patt-Shamir B, editors, 25th International Colloquium, SIROCCO 2018, Revised Selected Papers. Springer Verlag. 2018. p. 226-236. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-030-01325-7_21