activity
20172022
most citedThe k-Server with Preferences Problem

4 citations · 6 across the 4 of their papers we have counts for

collaborators

7 papers

cs.DS2022★ 4 cited

The k-Server with Preferences Problem

Jannik Castenow, Björn Feldkord, Till Knollmann +2

The -Server Problem covers plenty of resource allocation scenarios, and several variations have been studied extensively for decades. We present a model generalizing the -Ser…

cs.DS2020★ 1 cited

A Nearly Optimal Deterministic Online Algorithm for Non-Metric Facility Location

Marcin Bienkowski, Björn Feldkord, Paweł Schmidt

In the online non-metric variant of the facility location problem, there is a given graph consisting of a set of facilities (each with a certain opening cost), a set of pot…

cs.DS2020

The Online Multi-Commodity Facility Location Problem

Jannik Castenow, Björn Feldkord, Till Knollmann +2

We consider a natural extension to the metric uncapacitated Facility Location Problem (FLP) in which requests ask for different commodities out of a finite set of commodities.…

cs.DS2019

Managing Multiple Mobile Resources

Björn Feldkord, Till Knollmann, Manuel Malatyali +1

We extend the Mobile Server Problem, introduced in SPAA'17, to a model where k identical mobile resources, here named servers, answer requests appearing at points in the Euclidean…

cs.DS2019

The Mobile Server Problem

Björn Feldkord, Friedhelm Meyer auf der Heide

We introduce the mobile server problem, inspired by current trends to move computational tasks from cloud structures to multiple devices close to the end user. An example for this…

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…