The Steiner problem in distributed computing systems

DOI10.1016/0020-0255(93)90128-9MaRDI QIDQ1310949zbMATH OpenOpenAlexFDO

Authors Gen-Huey Chen, Michael E. Houle, Ming-Ter Kuo

Publication date 20 March 1994

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0255(93)90128-9

zbMATH Keywords

asynchronous networkSteiner treeweighted communication graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15)

Recommendations

• Computing and Combinatorics
• Optimal cost-sensitive distributed minimum spanning tree algorithm
• A faster approximation algorithm for the Steiner problem in graphs
• The distributed minimum spanning tree problem
• A factoring approach for the Steiner tree problem in undirected networks

Cites work

• scientific article; zbMATH DE number 3936534 (Why is no real title available?)
• 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 3446921 (Why is no real title available?)
• A Distributed Algorithm for Minimum-Weight Spanning Trees
• A fast algorithm for Steiner trees
• A faster approximation algorithm for the Steiner problem in graphs
• A fully distributed (minimal) spanning tree algorithm
• A note on two problems in connexion with graphs
• Complexity of network synchronization
• Reverse path forwarding of broadcast packets
• Steiner problem in networks: A survey
• The computation of nearly minimal Steiner trees in graphs

Cited in

(14)

• Parallelism in Steiner systems
• The dynamic predicate stashing copy problem and the Steiner problem in graphs
• Minimal communication cost software construction in the Internet environment
• Combinatorial optimization in system configuration design
• Computing and Combinatorics
• A super-stabilizing \(\log(n)\)-approximation algorithm for dynamic Steiner trees
• Distributed approximation algorithms for Steiner tree in the CONGESTED CLIQUE
• A distributed dual ascent algorithm for Steiner problems in multicast routing
• Optimal cost-sensitive distributed minimum spanning tree algorithm
• A survey of combinatorial optimization problems in multicast routing
• Improved distributed Steiner forest construction
• Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree
• Optimal relay node placement in delay constrained wireless sensor network design
• Construction of optimal communication structures for weighted distributed match-making

This page was built for publication: The Steiner problem in distributed computing systems

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