3 papers
cs.DS2025
The Steiner Shortest Path Tree Problem
Omer Asher, Yefim Dinitz, Shlomi Dolev +2
We introduce and study a novel problem of computing a shortest path tree with a minimum number of non-terminals. It can be viewed as an (unweighted) Steiner Shortest Path Tree (SSP…
cs.NI2022
Joint Scheduling and Resource Allocation for Packets with Deadlines and Priorities
Li-on Raviv, Amir Leshem
Cellular networks provide communication for different applications. Some applications have strict and very short latency requirements, while others require high bandwidth with vary…
cs.PF2018
Maximizing Service Reward for Queues with Deadlines
Li-on Raviv, Amir Leshem
In this paper we consider a real time queuing system with rewards and deadlines. We assume that packet processing time is known upon arrival, as is the case in communication networ…