The Steiner problem in distributed computing systems

DOI10.1016/0020-0255(93)90128-9zbMath0783.68041OpenAlexW1568087609MaRDI QIDQ1310949

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

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

Steiner treeasynchronous networkweighted 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)

Related Items (8)

Optimal relay node placement in delay constrained wireless sensor network design ⋮ A survey of combinatorial optimization problems in multicast routing ⋮ A super-stabilizing \(\log(n)\)-approximation algorithm for dynamic Steiner trees ⋮ Maximum metric spanning tree made Byzantine tolerant ⋮ A distributed dual ascent algorithm for Steiner problems in multicast routing ⋮ Combinatorial optimization in system configuration design ⋮ Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE ⋮ Primal-dual based distributed approximation algorithm for Prize-collecting Steiner tree

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• A fully distributed (minimal) spanning tree algorithm
• A fast algorithm for Steiner trees
• Complexity of network synchronization
• Steiner problem in networks: A survey
• A Distributed Algorithm for Minimum-Weight Spanning Trees
• Reverse path forwarding of broadcast packets
• The computation of nearly minimal Steiner trees in graphs
• A faster approximation algorithm for the Steiner problem in graphs

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