research
∙
01/16/2022
Lower bounds on the performance of online algorithms for relaxed packing problems
We prove new lower bounds for suitable competitive ratio measures of two...
share
research
∙
11/05/2019
Unbounded lower bound for k-server against weak adversaries
We study the resource augmented version of the k-server problem, also kn...
research
∙
11/22/2018
Better Bounds for Online Line Chasing
We study online competitive algorithms for the line chasing problem in E...
research
∙
10/01/2018
Slaying Hydrae: Improved Bounds for Generalized k-Server in Uniform Metrics
The generalized k-server problem is an extension of the weighted k-serve...
research
∙
07/18/2018
A φ-Competitive Algorithm for Scheduling Packets with Deadlines
In the online packet scheduling problem with deadlines (PacketScheduling...
research
∙
05/29/2018
