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.
@InProceedings{barbay_et_al:DagSemProc.09171.2, author = {Barbay, J\'{e}r\'{e}my and Klein, Rolf and L\'{o}pez-Ortiz, Alejandro and Niedermeier, Rolf}, title = {{09171 Executive Summary – Adaptive, Output Sensitive, Online and Parameterized Algorithms}}, booktitle = {Adaptive, Output Sensitive, Online and Parameterized Algorithms}, pages = {1--1}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9171}, editor = {J\'{e}r\'{e}my Barbay and Rolf Klein and Alejandro Ortiz-L\'{o}pez and Rolf Niedermeier}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09171.2}, URN = {urn:nbn:de:0030-drops-21207}, doi = {10.4230/DagSemProc.09171.2}, annote = {Keywords: Adaptive analysis, instance optimal algorithms, fixed parameter tractable, output sensitive algorithms} }
Feedback for Dagstuhl Publishing