21 citations · 57 across the 19 of their papers we have counts for
4 papers · 1 filter
Min-cost-flow preserving bijection between subgraphs and orientations
Izhak Elmaleh, Ohad N. Feldheim
Consider an undirected graph . A subgraph of is a subset of its edges, whilst an orientation of is an assignment of a direction to each edge. Provided with an inte…
Long-term balanced allocation via thinning
Ohad N. Feldheim, Ori Gurel-Gurevich, Jiange Li
We study the long-term behavior of the two-thinning variant of the classical balls-and-bins model. In this model, an overseer is provided with uniform random allocation of ball…
The Power of Two Choices in Graphical Allocation
Nikhil Bansal, Ohad Feldheim
The graphical balls-into-bins process is a generalization of the classical 2-choice balls-into-bins process, where the bins correspond to vertices of an arbitrary underlying graph…
Multi-layered planar firefighting
Arye Deutch, Ohad Noy Feldheim, Rani Hod
Consider a model of fire spreading through a graph; initially some vertices are burning, and at every given time-step fire spreads from burning vertices to their neighbours. The fi…