6 papers
A Discrete and Continuous Study of the Max-Chain-Formation Problem
Jannik Castenow, Peter Kling, Till Knollmann +1
Most existing robot formation problems seek a target formation of a certain \emph{minimal} and, thus, efficient structure. Examples include the Gathering and the Chain-Formation pr…
Gathering a Euclidean Closed Chain of Robots in Linear Time
Jannik Castenow, Jonas Harbig, Daniel Jung +2
This work focuses on the following question related to the Gathering problem of autonomous, mobile robots in the Euclidean plane: Is it possible to solve Gathering of robots th…
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 Self-Stabilizing Hashed Patricia Trie
Till Knollmann, Christian Scheideler
While a lot of research in distributed computing has covered solutions for self-stabilizing computing and topologies, there is far less work on self-stabilization for distributed d…
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…