License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.09171.3
URN: urn:nbn:de:0030-drops-21210
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2009/2121/
|
Go to the corresponding Portal |
Angelopoulos, Spyros
Parameterized Analysis of Online Steiner Tree Problems
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.
BibTeX - Entry
@InProceedings{angelopoulos:DagSemProc.09171.3,
author = {Angelopoulos, Spyros},
title = {{Parameterized Analysis of Online Steiner Tree Problems}},
booktitle = {Adaptive, Output Sensitive, Online and Parameterized Algorithms},
pages = {1--11},
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/opus/volltexte/2009/2121},
URN = {urn:nbn:de:0030-drops-21210},
doi = {10.4230/DagSemProc.09171.3},
annote = {Keywords: Online algorithms, Steiner tree problems, adaptive and parameteried analysis}
}
|
Keywords: |
|
Online algorithms, Steiner tree problems, adaptive and parameteried analysis |
|
Collection: |
|
09171 - Adaptive, Output Sensitive, Online and Parameterized Algorithms |
|
Issue Date: |
|
2009 |
|
Date of publication: |
|
31.07.2009 |
