2026-07-21T23:19:36Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:24895 2026-02-09T12:30:31Z ddc:004 open_access

Approximation Algorithms for Stochastic Optimization (Dagstuhl Seminar 25132) Hellerstein, Lisa Nagarajan, Viswanath Schewior, Kevin adaptivity approximation algorithms combinatorial optimization stochastic optimization This report documents the program and the outcomes of Dagstuhl Seminar 25132 "Approximation Algorithms for Stochastic Optimization". In this seminar, we gathered researchers from different areas interested in combinatorial optimization problems in which there is some stochasticity in the input. The focus was on approximation algorithms for computing adaptive or non-adaptive strategies to interact with this stochastic uncertainty as well as structural measures such as the adaptivity gap. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Lisa Hellerstein and Viswanath Nagarajan and Kevin Schewior 2025 Is Part Of Dagstuhl Reports, Volume 15, Issue 3 (2025) Article Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagRep.15.3.159 urn:nbn:de:0030-drops-248959 https://drops.dagstuhl.de/entities/document/10.4230/DagRep.15.3.159 eng https://creativecommons.org/licenses/by/4.0/legalcode