Simple distributed algorithms for approximating minimum Steiner trees
From MaRDI portal
Recommendations
Cited in
(16)- The Steiner problem in distributed computing systems
- A distributed dual ascent algorithm for the Hop-constrained Steiner tree problem
- Evaluating Steiner-tree heuristics and diameter variations for application layer multicast
- Improved distributed Steiner forest construction
- A super-stabilizing \(\log(n)\)-approximation algorithm for dynamic Steiner trees
- scientific article; zbMATH DE number 1304096 (Why is no real title available?)
- Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree
- A distributed dual ascent algorithm for Steiner problems in multicast routing
- A Distributed Primal-Dual Heuristic for Steiner Problems in Networks
- Distributed approximation of minimum routing cost trees
- Almost-Tight Distributed Minimum Cut Algorithms
- Distributed approximation algorithms for Steiner tree in the CONGESTED CLIQUE
- Efficient distributed approximation algorithms via probabilistic tree embeddings
- A note on distributed multicast routing in point-to-point networks
- Massively parallel approximate Steiner tree algorithms
- Short proofs for online multiclass prediction on graphs
This page was built for publication: Simple distributed algorithms for approximating minimum Steiner trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5716955)