Online Minimum Spanning Tree with Advice

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

Publikováno v: International Journal of Foundations of Computer Science, 29 (4)
Lecture Notes in Computer Science ISBN: 9783662491911

In the online minimum spanning tree problem, a graph is revealed vertex by vertex; together with every vertex, all edges to vertices that are already known are given, and an online algorithm must irrevocably choose a subset of them as a part of its s

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::52e4d7059d9dc2f53c5b21688c28be1b
https://doi.org/10.1142/s0129054118410034