Motivated by applications from ride-sharing and kidney exchange, we study the problem of
matching agents who arrive at a marketplace over time and leave after d time periods …

This paper addresses the problem of cell placement which is considered crucial for layout
quality. Based on the combined analytical and partitioning strategy successfully applied in …

Over the past decade, there has been great interest in the study of buffer management
policies in the context of packet transmission for network switches. In a typical model, a …

In this paper, we consider the problem of scheduling real-time traffic in wireless networks
under a conflict-graph interference model and single-hop traffic. The objective is to …

We study the problem of matching agents who arrive at a marketplace over time and leave
after d time periods. Agents can only be matched while they are present in the marketplace …

The following buffer management problem arises in network switches providing
differentiated services: At the beginning of each time step, one packet can be sent, and …

Frequently, ISPs charge for Internet use not based on peak bandwidth usage, but according
to a percentile (often the 95th percentile) cost model. In other words, the time slots with the …

As the Internet becomes more mature, there is a realization that improving the performance
of routers has the potential to substantially improve Internet performance in general …

LNCS 7501 - Open Problems in Throughput Scheduling Page 1 Open Problems in Throughput
Scheduling Jirı Sgall ⋆ Computer Science Institute of Charles University, Faculty of Mathematics …

In the online packet scheduling problem with deadlines (, for short), the goal is to schedule
transmissions of packets that arrive over time in a network switch and need to be sent across …