18 citations · 25 across the 12 of their papers we have counts for
16 papers
Better Bounds for Online Line Chasing
Marcin Bienkowski, Jarosław Byrka, Marek Chrobak +3
We study online competitive algorithms for the \emph{line chasing problem} in Euclidean spaces , where the input consists of an initial point and a sequence of line…
Slaying Hydrae: Improved Bounds for Generalized k-Server in Uniform Metrics
Marcin Bienkowski, Łukasz Jeż, Paweł Schmidt
The generalized -server problem is an extension of the weighted -server problem, which in turn extends the classic -server problem. In the generalized -server problem,…
A -Competitive Algorithm for Scheduling Packets with Deadlines
Pavel Veselý, Marek Chrobak, Łukasz Jeż +1
In the online packet scheduling problem with deadlines (PacketSchD, for short), the goal is to schedule transmissions of packets that arrive over time in a network switch and need…
Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption
Christoph Dürr, Łukasz Jeż, Oscar C. Vásquez
Since a few years there is an increasing interest in minimizing the energy consumption of computing systems. However in a shared computing system, users want to optimize their expe…
Logarithmic price of buffer downscaling on line metrics
Marcin Bienkowski, Martin Böhm, Łukasz Jeż +5
We consider the reordering buffer problem on a line consisting of n equidistant points. We show that, for any constant delta, an (offline) algorithm that has a buffer (1-delta) k p…
Online Packet Scheduling with Bounded Delay and Lookahead
Martin Böhm, Marek Chrobak, Łukasz Jeż +3
We study the online bounded-delay packet scheduling problem (BDPS), where packets of unit size arrive at a router over time and need to be transmitted over a network link. Each pac…