A super-stabilizing (n)-approximation algorithm for dynamic Steiner trees
DOI10.1016/J.TCS.2013.07.003zbMATH Open1296.68192OpenAlexW2054818168MaRDI QIDQ388463FDOQ388463
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
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
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)
Cites Work
- Title not available (Why is that?)
- Self-stabilization
- Self-stabilizing systems in spite of distributed control
- Title not available (Why is that?)
- Title not available (Why is that?)
- Steiner problem in networks: A survey
- Dynamic Steiner Tree Problem
- The Steiner problem in distributed computing systems
- A fast algorithm for Steiner trees
- Title not available (Why is that?)
- A faster approximation algorithm for the Steiner problem in graphs
- Time Optimal Asynchronous Self-stabilizing Spanning Tree
- Title not available (Why is that?)
- A SELF-STABILIZING DISTRIBUTED ALGORITHM FOR ALL-PAIRS SHORTEST PATH PROBLEM
Cited In (2)
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)
