4 citations · 4 across the 3 of their papers we have counts for
4 papers · 1 filter
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…
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.…
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…
Monitoring of Domain-Related Problems in Distributed Data Streams
Pascal Bemmann, Felix Biermeier, Jan Bürmann +10
Consider a network in which distributed nodes are connected to a single server. Each node continuously observes a data stream consisting of one value per discrete time step. Th…