52 citations · 106 across the 21 of their papers we have counts for
Showing 2012 · cs.DSShow all
2 papers · 2 filters
cs.DS2012
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…
cs.DS2012
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…