DagSemProc.09171.2.pdf
- Filesize: 61 kB
- 1 pages
Document
09171 Executive Summary – Adaptive, Output Sensitive, Online and Parameterized Algorithms
Authors
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 9171
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2009-07-31
Cite AsGet BibTex
Jérémy Barbay, Rolf Klein, Alejandro López-Ortiz, and Rolf Niedermeier. 09171 Executive Summary – Adaptive, Output Sensitive, Online and Parameterized Algorithms. In Adaptive, Output Sensitive, Online and Parameterized Algorithms. Dagstuhl Seminar Proceedings, Volume 9171, p. 1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
https://doi.org/10.4230/DagSemProc.09171.2
https://doi.org/10.4230/DagSemProc.09171.2
Abstract
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.
Keywords
- Adaptive analysis
- instance optimal algorithms
- fixed parameter tractable
- output sensitive algorithms
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads