Online minimum spanning tree with advice (extended abstract)

DOI10.1007/978-3-662-49192-8_16MaRDI QIDQ5890525zbMATH OpenOpenAlexFDO

Authors Maria Paola Bianchi, Tatjana Brülisauer, Dennis Komm, Beatrice Palano, Hans-Joachim Böckenhauer

Publication date 10 March 2016

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-49192-8_16

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Online Minimum Spanning Tree with Advice
• Tight bounds for the advice complexity of the online minimum Steiner tree problem
• On an Online Spanning Tree Problem in Randomly Weighted Graphs
• scientific article; zbMATH DE number 1670813
• On the advice complexity of the k-server problem

Cited in

(8)

• On an Online Spanning Tree Problem in Randomly Weighted Graphs
• Online bin packing with advice of small size
• Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
• The power of recourse for online MST and TSP
• Offline Algorithms for Dynamic Minimum Spanning Tree Problems
• Online Minimum Spanning Tree with Advice
• The power of recourse for online MST and TSP
• Tight bounds for the advice complexity of the online minimum Steiner tree problem

This page was built for publication: Online minimum spanning tree with advice (extended abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5890525)