4 citations · 4 across the 5 of their papers we have counts for
4 papers · 1 filter
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 . This problem is equivalent to the Minimum…
A Deterministic Distributed -Approximation for Weighted Vertex Cover in Rounds
Ran Ben-Basat, Guy Even, Ken-ichi Kawarabayashi +1
We present a deterministic distributed -approximation algorithm for the Minimum Weight Vertex Cover problem in the CONGEST model whose round complexity is $O(\log n \log Δ/ \log…
Dynamically Sacrificing Accuracy for Reduced Computation: Cascaded Inference Based on Softmax Confidence
Konstantin Berestizshevsky, Guy Even
We study the tradeoff between computational effort and classification accuracy in a cascade of deep neural networks. During inference, the user sets the acceptable accuracy degrada…
Survivable Network Design for Group Connectivity in Low-Treewidth Graphs
Parinya Chalermsook, Syamantak Das, Guy Even +2
In the Group Steiner Tree problem (GST), we are given a (vertex or edge)-weighted graph on vertices, a root vertex and a collection of groups $\{S_i\}_{i\in[h]}:…