1 citations · 2 across the 5 of their papers we have counts for
5 papers · 1 filter
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…
Completeness in the Polynomial Hierarchy for many natural Problems in Bilevel and Robust Optimization
Christoph Grüne, Lasse Wulf
In bilevel and robust optimization we are concerned with combinatorial min-max problems, for example from the areas of min-max regret robust optimization, network interdiction, mos…
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…
The Complexity Classes of Hamming Distance Recoverable Robust Problems
Christoph Grüne
In the well-known complexity class NP are combinatorial problems, whose optimization counterparts are important for many practical settings. These problems typically consider full…