Massively Parallel Approximate Steiner Tree Algorithms
Authors:
- 3 August 2025
- book chapter
- Published by Springer Nature
- p. 110-124
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Quantum Distributed Algorithms for Approximate Steiner Trees and Directed Minimum Spanning Trees2023
- Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUEInternational Journal of Foundations of Computer Science, 2020
- Parallel Graph Connectivity in Log Diameter Rounds2018
- A Survey of Parallel and Distributed Algorithms for the Steiner Tree ProblemInternational Journal of Parallel Programming, 2013
- Sorting, Searching, and Simulation in the MapReduce Framework2011
- Efficient distributed approximation algorithms via probabilistic tree embeddings2008
- Parallel Minimum Spanning Tree Heuristic for the steiner problem in graphs2007
- Simple Distributed Algorithms for Approximating Minimum Steiner Trees2005
- A faster approximation algorithm for the Steiner problem in graphsActa Informatica, 1986
- A fast algorithm for Steiner treesActa Informatica, 1981