2 citations · 2 across the 1 of their papers we have counts for
4 papers
An Optimal Algorithm for Online Multiple Knapsack
Marcin Bienkowski, Maciej Pacut, Krzysztof Piecuch
In the online multiple knapsack problem, an algorithm faces a stream of items, and each item has to be either rejected or stored irrevocably in one of bins (knapsacks) of equal…
Unbounded lower bound for k-server against weak adversaries
Marcin Bienkowski, Jarosław Byrka, Christian Coester +1
We study the resource augmented version of the -server problem, also known as the -server problem against weak adversaries or the -server problem. In this setting, an…
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…
Online Strategies for Intra and Inter Provider Service Migration in Virtual Networks
Dushyant Arora, Marcin Bienkowski, Anja Feldmann +2
Network virtualization allows one to build dynamic distributed systems in which resources can be dynamically allocated at locations where they are most useful. In order to fully ex…