In this work we study a wide range of online and offline routing and packing problems with various objectives. We provide a unified approach, based on a clean primal-dual method...
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
We consider a one dimensional storage system where each container can store a bounded amount of capacity as well as a bounded number of items k ≥ 2. This defines the (standard)...
In the traveling repairman problem (Trp), a tour must be found through every one of a set of points (cities) in some metric space such that the weighted sum of completion times of ...
Sven Oliver Krumke, Willem de Paepe, Diana Poensge...
We design algorithms for two online variance minimization problems. Specifically, in every trial t our algorithms get a covariance matrix Ct and try to select a parameter vector wt...