52 citations · 106 across the 21 of their papers we have counts for
4 papers · 1 filter
Hitting Sets Online and Unique-Max Coloring
Guy Even, Shakhar Smorodinsky
We consider the problem of hitting sets online. The hypergraph (i.e., range-space consisting of points and ranges) is known in advance, and the ranges to be stabbed are input one-b…
Local-Optimality Guarantees for Optimal Decoding Based on Paths
Guy Even, Nissim Halabi
This paper presents a unified analysis framework that captures recent advances in the study of local-optimality characterizations for codes on graphs. These local-optimality charac…
Hierarchies of Local-Optimality Characterizations in Decoding of Tanner Codes
Nissim Halabi, Guy Even
Recent developments in decoding of Tanner codes with maximum-likelihood certificates are based on a sufficient condition called local-optimality. We define hierarchies of locally-o…
Online Multi-Commodity Flow with High Demands
Guy Even, Moti Medina
This paper deals with the problem of computing, in an online fashion, a maximum benefit multi-commodity flow (\ONMCF), where the flow demands may be bigger than the edge capacities…