2 papers
cs.DS2017
A Collection of Lower Bounds for Online Matching on the Line
Antonios Antoniadis, Carsten Fischer, Andreas Tönnis
In the online matching on the line problem, the task is to match a set of requests online to a given set of servers . The distance metric between any two points in $R\,\cup\…
cs.DS2015
Probabilistic Analysis of the Dual Next-Fit Algorithm for Bin Covering
Carsten Fischer, Heiko Röglin
In the bin covering problem, the goal is to fill as many bins as possible up to a certain minimal level with a given set of items of different sizes. Online variants, in which the…