Massively parallel approximate Steiner tree algorithms

DOI10.1007/978-981-95-0218-9_9MaRDI QIDQ6866544zbMATH OpenFDO

Authors Chilei Wang, Qiang-Sheng Hua, Hai Jin

Publication date 28 January 2026

Full work available at URL https://doi.org/10.1007/978-981-95-0218-9_9

zbMATH Keywords

round complexitySPFSteiner treethe MPC model

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites work

• A deterministic algorithm for the MST problem in constant rounds of congested clique
• A fast algorithm for Steiner trees
• A faster approximation algorithm for the Steiner problem in graphs
• Algebraic methods in the congested clique
• Computing and Combinatorics
• Deterministic massively parallel connectivity
• Distributed approximation algorithms for Steiner tree in the CONGESTED CLIQUE
• Efficient distributed approximation algorithms via probabilistic tree embeddings
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 7650885 (Why is no real title available?)
• Improved distributed Steiner forest construction
• Introduction to algorithms.
• Parallel graph connectivity in log diameter rounds
• Sorting, searching, and simulation in the MapReduce framework
• The Steiner problem in distributed computing systems

This page was built for publication: Massively parallel approximate Steiner tree algorithms

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