4 citations · 6 across the 4 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DS2017★ 1 cited
A Tight Approximation for Fully Dynamic Bin Packing without Bundling
Björn Feldkord, Matthias Feldotto, Sören Riechers
We consider a variant of the classical Bin Packing Problem, called Fully Dynamic Bin Packing. In this variant, items of a size in must be packed in bins of unit size. In ea…
cs.DS2017
A Communication-Efficient Distributed Data Structure for Top-k and k-Select Queries
Felix Biermeier, Björn Feldkord, Manuel Malatyali +1
We consider the scenario of sensor nodes observing streams of data. The nodes are connected to a central server whose task it is to compute some function over all data items ob…