1 citations · 2 across the 5 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.CC2023
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…
cs.CC2023★ 1 cited
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…