1 citations · 1 across the 4 of their papers we have counts for
7 papers
Gathering Anonymous, Oblivious Robots on a Grid
Matthias Fischer, Daniel Jung, Friedhelm Meyer auf der Heide
We consider a swarm of autonomous mobile robots, distributed on a 2-dimensional grid. A basic task for such a swarm is the gathering process: All robots have to gather at one (…
On Competitive Algorithms for Approximations of Top-k-Position Monitoring of Distributed Streams
Alexander Mäcker, Manuel Malatyali, Friedhelm Meyer auf der Heide
Consider the continuous distributed monitoring model in which distributed nodes, receiving individual data streams, are connected to a designated server. The server is asked to…
Gathering a Closed Chain of Robots on a Grid
Sebastian Abshoff, Andreas Cord-Landwehr, Matthias Fischer +2
We consider the following variant of the two dimensional gathering problem for swarms of robots: Given a swarm of indistinguishable, point shaped robots on a two dimensional gr…
Approximation and Heuristic Algorithms for Computing Backbones in Asymmetric Ad-Hoc Networks
Faisal N. Abu-Khzam, Christine Markarian, Friedhelm Meyer auf der Heide +1
We consider the problem of dominating set-based virtual backbone used for routing in asymmetric wireless ad-hoc networks. These networks have non-uniform transmission ranges and ar…
Towards Gathering Robots with Limited View in Linear Time: The Closed Chain Case
Sebastian Abshoff, Andreas Cord-Landwehr, Daniel Jung +1
In the gathering problem, n autonomous robots have to meet on a single point. We consider the gathering of a closed chain of point-shaped, anonymous robots on a grid. The robots on…
Quality of Service in Network Creation Games
Andreas Cord-Landwehr, Alexander Mäcker, Friedhelm Meyer auf der Heide
Network creation games model the creation and usage costs of networks formed by n selfish nodes. Each node v can buy a set of edges, each for a fixed price α> 0. Its goal is to min…