Tight Bounds for the Advice Complexity of the Online Minimum Steiner Tree Problem
From MaRDI portal
Publication:2938096
DOI10.1007/978-3-319-04298-5_8zbMath1432.68587OpenAlexW203393659MaRDI QIDQ2938096
Publication date: 13 January 2015
Published in: SOFSEM 2014: Theory and Practice of Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/20.500.11850/69872
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Online algorithms; streaming algorithms (68W27)
Related Items (4)
A Technique to Obtain Hardness Results for Randomized Online Algorithms – A Survey ⋮ Optimal Online Edge Coloring of Planar Graphs with Advice ⋮ The advice complexity of a class of hard online problems ⋮ Online Minimum Spanning Tree with Advice
This page was built for publication: Tight Bounds for the Advice Complexity of the Online Minimum Steiner Tree Problem