1 citations · 1 across the 4 of their papers we have counts for
4 papers
Approximating -Dispersion
Tom Janßen
We consider a continuous facility location problem called -Dispersion. For some fixed , the goal is to place as many facilities on a graph as possible with pairwise distan…
Continuous Defensive Domination Problems
Christoph Grüne, Tom Janßen
The problem Defensive -Covering, for some covering range , is a continuous facility location problem on undirected graphs where all edges have unit length. It is a general…
The Complexity of Graph Exploration Games
Janosch Fuchs, Christoph Grüne, Tom Janßen
Graph Exploration problems ask a searcher to explore an unknown environment. The environment is modeled as a graph, where the searcher needs to visit each vertex beginning at some…
The Complexity of Online Graph Games
Janosch Fuchs, Christoph Grüne, Tom Janßen
Online computation is a concept to model uncertainty where not all information on a problem instance is known in advance. An online algorithm receives requests which reveal the ins…