The Steiner problem in distributed computing systems
type: Item
instance of: scholarly article
title: The Steiner problem in distributed computing systems
zbMATH Open document ID: 0783.68041
DOI: 10.1016/0020-0255(93)90128-9
author: Gen-Huey Chen
author: Michael E. Houle
author: Ming-Ter Kuo
published in: Information Sciences
publication date: 1994-03-20T00:00:00Z
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 484084
zbMATH Keywords: Steiner tree
zbMATH Keywords: asynchronous network
zbMATH Keywords: weighted communication graph
MaRDI profile type: Publication
full work available at URL: 0020-0255(93)90128-9
OpenAlex ID: W1568087609
cites work: Complexity of network synchronization
cites work: Reverse path forwarding of broadcast packets
cites work: Q4770975
cites work: A note on two problems in connexion with graphs
cites work: A Distributed Algorithm for Minimum-Weight Spanning Trees
cites work: Q4198056
cites work: A fast algorithm for Steiner trees
cites work: A fully distributed (minimal) spanning tree algorithm
cites work: The computation of nearly minimal Steiner trees in graphs
cites work: Q3874241
cites work: Q3707420
cites work: Steiner problem in networks: A survey
cites work: A faster approximation algorithm for the Steiner problem in graphs
description: scientific article; zbMATH DE number 484084