h1

h2

h3

h4

h5
h6
%0 Conference Paper
%A Grüne, Christoph
%A Wulf, Lasse
%T On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy
%V 345
%I Schloss Dagstuhl - Leibniz-Zentrum für Informatik
%M RWTH-CONV-254847
%B LIPIcs
%P 52:1-52:18
%D 2025
%< 50th International Symposium on Mathematical Foundations of Computer Science, MFCS 2025, August 25-29, 2025, Warsaw, Poland
%B 50. International Symposium on Mathematical Foundations of Computer Science
%C 25 Aug 2025 - 29 Aug 2025, Warsaw (Poland)
Y2 25 Aug 2025 - 29 Aug 2025
M2 Warsaw, Poland
%F PUB:(DE-HGF)7 ; PUB:(DE-HGF)8
%9 Contribution to a bookContribution to a conference proceedings
%R 10.4230/LIPICS.MFCS.2025.52
%U https://publications.rwth-aachen.de/record/1018370