A super-stabilizing \(\log(n)\)-approximation algorithm for dynamic Steiner trees

DOI10.1016/j.tcs.2013.07.003zbMath1296.68192OpenAlexW2054818168MaRDI QIDQ388463

Lélia Blin, Stephane Rovedakis, Maria Gradinariu Potop-Butucaru

Publication date: 19 December 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.07.003

zbMATH Keywords

multicastself-stabilizationdynamic Steiner treemessage passing networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Approximation algorithms (68W25) Distributed algorithms (68W15)

Related Items (1)

Maximum metric spanning tree made Byzantine tolerant

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A fast algorithm for Steiner trees
• The Steiner problem in distributed computing systems
• Time Optimal Asynchronous Self-stabilizing Spanning Tree
• Steiner problem in networks: A survey
• Dynamic Steiner Tree Problem
• Self-stabilizing systems in spite of distributed control
• A SELF-STABILIZING DISTRIBUTED ALGORITHM FOR ALL-PAIRS SHORTEST PATH PROBLEM
• A faster approximation algorithm for the Steiner problem in graphs

This page was built for publication: A super-stabilizing \(\log(n)\)-approximation algorithm for dynamic Steiner trees