2026-07-20T10:52:13Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:2120 2024-03-06T11:08:44Z ddc:004 open_access

09171 Executive Summary – Adaptive, Output Sensitive, Online and Parameterized Algorithms Barbay, Jérémy Klein, Rolf López-Ortiz, Alejandro Niedermeier, Rolf Adaptive analysis instance optimal algorithms fixed parameter tractable output sensitive algorithms Traditionally the analysis of algorithms measures the complexity of a problem or algorithm in terms of the worst-case behavior over all inputs of a given size. However, in certain cases an improved algorithm can be obtained by considering a finer partition of the input space. As this idea has been independently rediscovered in many areas, the workshop gathered participants from different fields in order to explore the impact and the limits of this technique, in the hope to spring new collaboration and to seed the unification of the technique. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Jérémy Barbay and Rolf Klein and Alejandro López-Ortiz and Rolf Niedermeier 2009 Is Part Of Dagstuhl Seminar Proceedings, Volume 9171, Adaptive, Output Sensitive, Online and Parameterized Algorithms (2009) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.09171.2 urn:nbn:de:0030-drops-21207 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09171.2 eng https://creativecommons.org/licenses/by/4.0/legalcode