1 citations · 1 across the 3 of their papers we have counts for
3 papers
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…
Multilevel Network Games
Sebastian Abshoff, Andreas Cord-Landwehr, Daniel Jung +1
We consider a multilevel network game, where nodes can improve their communication costs by connecting to a high-speed network. The nodes are connected by a static network and…
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…