h1

h2

h3

h4

h5
h6
http://join2-wiki.gsi.de/foswiki/pub/Main/Artwork/join2_logo100x88.png

On the Complexity of Recoverable Robust Optimization in the Polynomial Hierarchy

;

In
50th International Symposium on Mathematical Foundations of Computer Science, MFCS 2025, August 25-29, 2025, Warsaw, Poland, Seiten/Artikel-Nr: 52:1-52:18

Konferenz/Event:50. International Symposium on Mathematical Foundations of Computer Science , Warsaw , Poland , MFCS 2025 , 2025-08-25 - 2025-08-29

: Schloss Dagstuhl - Leibniz-Zentrum für Informatik

Umfang52:1-52:18

ReiheLIPIcs ; 345

Online
DOI: 10.4230/LIPICS.MFCS.2025.52


Einrichtungen

  1. Lehrstuhl für Algorithmen und Komplexität (Informatik 1) (121110)
  2. Fachgruppe Informatik (120000)
  3. Graduiertenkolleg UnRAVeL (080060)

Projekte

  1. GRK 2236 - GRK 2236: Unsicherheit und Randomisierung in Algorithmen, Verifikation und Logik. (282652900) (282652900)


Dokumenttyp
Contribution to a book/Contribution to a conference proceedings

Format
online

Sprache
English

Externe Identnummern
SCOPUS: SCOPUS:2-s2.0-105014762963

Interne Identnummern
RWTH-CONV-254847
Datensatz-ID: 1018370

 GO

QR Code for this record

The record appears in these collections:
Document types > Events > Contributions to a conference proceedings
Document types > Books > Contributions to a book
Faculty of Mathematics, Computer Science and Natural Sciences (Fac.1) > Department of Computer Science
Central and Other Institutions
Documents in print
Public records
120000
121110
080060
 Record created 2025-09-16, last modified 2025-09-19
Similar records



Rate this document:

Rate this document:
1
2
3
4
5
 
(Not yet reviewed)