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

DOI10.1016/J.TCS.2013.07.003MaRDI QIDQ388463zbMATH OpenOpenAlexFDO

Authors Lélia Blin, Stephane Rovedakis, Maria 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

self-stabilizationmulticastdynamic Steiner treemessage passing networks

Mathematics Subject Classification ID

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

Recommendations

• Computing and Combinatorics
• Dynamic Steiner Tree Problem
• A self-stabilizing distributed algorithm to construct an arbitrary spanning tree of a connected graph
• scientific article; zbMATH DE number 2006653
• A self-stabilizing 3-approximation for the maximum leaf spanning tree problem in arbitrary networks

Cites work

• scientific article; zbMATH DE number 3677874 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1330032 (Why is no real title available?)
• scientific article; zbMATH DE number 1332668 (Why is no real title available?)
• scientific article; zbMATH DE number 1950682 (Why is no real title available?)
• A SELF-STABILIZING DISTRIBUTED ALGORITHM FOR ALL-PAIRS SHORTEST PATH PROBLEM
• A fast algorithm for Steiner trees
• A faster approximation algorithm for the Steiner problem in graphs
• Dynamic Steiner Tree Problem
• Self-stabilization
• Self-stabilizing systems in spite of distributed control
• Steiner problem in networks: A survey
• The Steiner problem in distributed computing systems
• Time Optimal Asynchronous Self-stabilizing Spanning Tree

Cited in

(1)

• The Power of Dynamic Distance Oracles

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

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