3 citations · 3 across the 4 of their papers we have counts for
4 papers
Better Online Deterministic Packet Routing on Grids
Guy Even, Moti Medina, Boaz Patt-Shamir
We consider the following fundamental routing problem. An adversary inputs packets arbitrarily at sources, each packet with an arbitrary destination. Traffic is constrained by link…
Online Packet-Routing in Grids with Bounded Buffers
Guy Even, Moti Medina
We present deterministic and randomized algorithms for the problem of online packet routing in grids in the competitive network throughput model \cite{AKOR}. In this model the netw…
Distributed Maximum Matching in Bounded Degree Graphs
Guy Even, Moti Medina, Dana Ron
We present deterministic distributed algorithms for computing approximate maximum cardinality matchings and approximate maximum weight matchings. Our algorithm for the unweighted c…
Improved Approximation for Orienting Mixed Graphs
Iftah Gamzu, Moti Medina
An instance of the maximum mixed graph orientation problem consists of a mixed graph and a collection of source-target vertex pairs. The objective is to orient the undirected edges…