3 papers
cs.DS2026
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…
cs.CC2026
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…
cs.CC2023
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…