G. Even

activity

20112022

most citedMinimal Controllability of Conjunctive Boolean Networks is NP-Complete

52 citations · 106 across the 21 of their papers we have counts for

collaborators

Showing 2018 · cs.DCShow all

2 papers · 2 filters

cs.DC2018★ 1 cited

Optimal Distributed Weighted Set Cover Approximation

Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi +1

We present a time-optimal deterministic distributed algorithm for approximating a minimum weight vertex cover in hypergraphs of rank $f$ . This problem is equivalent to the Minimum…

cs.DC2018

A Deterministic Distributed $2$ -Approximation for Weighted Vertex Cover in $O (lo g n lo g Δ/ lo g^{2} lo g Δ)$ Rounds

Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi +1

We present a deterministic distributed $2$ -approximation algorithm for the Minimum Weight Vertex Cover problem in the CONGEST model whose round complexity is $O(\log n \log Δ/ \log…

Optimal Distributed Weighted Set Cover Approximation

A Deterministic Distributed 2-Approximation for Weighted Vertex Cover in O(lognlogΔ/log2logΔ) Rounds

A Deterministic Distributed $2$ -Approximation for Weighted Vertex Cover in $O (lo g n lo g Δ/ lo g^{2} lo g Δ)$ Rounds