On the Competitiveness of the Online Asymmetric and Euclidean Steiner Tree Problems

DOI10.1007/978-3-642-12450-1_1zbMath1284.68676OpenAlexW1557629339MaRDI QIDQ3558908

Spyros Angelopoulos

Publication date: 11 May 2010

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-12450-1_1

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Online algorithms; streaming algorithms (68W27)

Related Items (4)

Non-greedy online Steiner trees on outerplanar graphs ⋮ Non-greedy Online Steiner Trees on Outerplanar Graphs ⋮ The Bursty Steiner Tree Problem ⋮ Parameterized analysis of the online priority and node-weighted Steiner tree problems

This page was built for publication: On the Competitiveness of the Online Asymmetric and Euclidean Steiner Tree Problems