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