6 citations · 6 across the 3 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2017
Improved Algorithms for Scheduling Unsplittable Flows on Paths
Hamidreza Jahanjou, Erez Kantor, Rajmohan Rajaraman
In this paper, we investigate offline and online algorithms for rufpp, the problem of minimizing the number of rounds required to schedule a set of unsplittable flows of non-unifor…
cs.DS2015
Optimal competitiveness for the Rectilinear Steiner Arborescence problem
Erez Kantor, Shay Kutten
We present optimal online algorithms for two related known problems involving Steiner Arborescence, improving both the lower and the upper bounds. One of them is the well studied c…
cs.DS2011
The Topology of Wireless Communication
Erez Kantor, Zvi Lotker, Merav Parter +1
In this paper we study the topological properties of wireless communication maps and their usability in algorithmic design. We consider the SINR model, which compares the received…