2 citations · 2 across the 4 of their papers we have counts for
6 papers
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…
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…
Non-Clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times
Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide +1
Consider a problem in which jobs that are classified into types arrive over time at their release times and are to be scheduled on a single machine so as to minimize the ma…
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…
Non-Preemptive Scheduling on Machines with Setup Times
Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide +1
Consider the problem in which n jobs that are classified into k types are to be scheduled on m identical machines without preemption. A machine requires a proper setup taking s tim…