Document Open Access Logo

Online Algorithms beyond Competitive Analysis (Dagstuhl Seminar 25471)

Authors Sungjin Im, Nicole Megow, Debmalya Panigrahi, Sahil Singla, Golnoosh Shahkarami and all authors of the abstracts in this report

PDF

File

Thumbnail PDF
PDF
DagRep.15.11.114.pdf
  • Filesize: 2.59 MB
  • 20 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Online algorithms
Keywords
  • algorithms under uncertainty
  • beyond worst-case algorithm design
  • online algorithms

Metrics

Abstract

This report documents the program and the outcomes of Dagstuhl Seminar 25471: "Online Algorithms beyond Competitive Analysis". This seminar brought 45 leading researchers in online algorithms and related areas together for a discussion of the recent progress and challenges in various aspects of online algorithms. The seminar included several talks of varying lengths and an open problem session. In addition, sufficient time was set aside for research discussions and collaborations.

Cite As Get BibTex

Sungjin Im, Nicole Megow, Debmalya Panigrahi, Sahil Singla, and Golnoosh Shahkarami. Online Algorithms beyond Competitive Analysis (Dagstuhl Seminar 25471). In Dagstuhl Reports, Volume 15, Issue 11, pp. 114-133, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026) https://doi.org/10.4230/DagRep.15.11.114

Author Details

Sungjin Im
  • University of California - Santa Cruz, US
Nicole Megow
  • Universität Bremen, DE
Debmalya Panigrahi
  • Duke University - Durham, US
Sahil Singla
  • Georgia Institute of Technology - Atlanta, US
Golnoosh Shahkarami
  • MPI für Informatik - Saarbrücken, DE & Univerisität Bremen, DE
and all authors of the abstracts in this report
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact