Till Knollmann
YOU?
Author Swipe
View article: A Unifying Approach to Efficient (Near)-Gathering of Disoriented Robots with Limited Visibility
A Unifying Approach to Efficient (Near)-Gathering of Disoriented Robots with Limited Visibility Open
We consider a swarm of n robots in a d-dimensional Euclidean space. The robots are oblivious (no persistent memory), disoriented (no common coordinate system/compass), and have limited visibility (observe other robots up to a constant dist…
View article: The k-Server with Preferences Problem
The k-Server with Preferences Problem Open
The $k$-Server Problem covers plenty of resource allocation scenarios, and several variations have been studied extensively for decades. We present a model generalizing the $k$-Server Problem by preferences of the requests, where the serve…
View article: Distributed Data Streams
Distributed Data Streams Open
We consider a scenario where a server is wirelessly connected to countless sensor nodes that continuously measure data. The task of the server is to monitor the sensors’ data. More precisely, at each time step the server calculates a funct…
View article: The Max-Line-Formation Problem
The Max-Line-Formation Problem Open
We consider n robots with limited visibility: each robot can observe other robots only up to a constant distance denoted as the viewing range. The robots operate in discrete rounds that are either fully synchronous (FSync) or semi-synchron…
View article: A Discrete and Continuous Study of the Max-Chain-Formation Problem
A Discrete and Continuous Study of the Max-Chain-Formation Problem Open
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 problem. In this work, we study formation problems that try t…
View article: The Online Multi-Commodity Facility Location Problem
The Online Multi-Commodity Facility Location Problem Open
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 $S$ of commodities. Ravi and Sinha (SODA'04) introduced the model as the Multi-…
View article: Mincut Sensitivity Data Structures for the Insertion of an Edge
Mincut Sensitivity Data Structures for the Insertion of an Edge Open
Let G = (V,E) be an undirected graph on n vertices with non-negative capacities on its edges. The mincut sensitivity problem for the insertion of an edge is defined as follows. Build a compact data structure for G and a given set S ⊆ V of …
View article: Monitoring of Domain-Related Problems in Distributed Data Streams
Monitoring of Domain-Related Problems in Distributed Data Streams Open
Consider a network in which $n$ distributed nodes are connected to a single server. Each node continuously observes a data stream consisting of one value per discrete time step. The server has to continuously monitor a given parameter defi…