DagSemProc.09171.3.pdf
- Filesize: 172 kB
- 11 pages
Document
Parameterized Analysis of Online Steiner Tree Problems
Author
-
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
Spyros Angelopoulos. Parameterized Analysis of Online Steiner Tree Problems. In Adaptive, Output Sensitive, Online and Parameterized Algorithms. Dagstuhl Seminar Proceedings, Volume 9171, pp. 1-11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
https://doi.org/10.4230/DagSemProc.09171.3
https://doi.org/10.4230/DagSemProc.09171.3
Abstract
Steiner tree problems occupy a central place in both areas of approximation and on-line algorithms. Many variants have been studied from the point of view of competitive analysis, and for several of these variants tight bounds are known. However, in several cases, worst-case analysis is overly pessimistic, which fails to explain the relative performance of algorithms. We show how adaptive analysis can help resolve this problem. As case studies, we consider the Steiner tree problem in directed graphs, and the Priority Steiner tree problem.
Keywords
- Online algorithms
- Steiner tree problems
- adaptive and parameteried analysis
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads