https://scholars.lib.ntu.edu.tw/handle/123456789/117194
Title: | The Steiner Problem in Distributed Computing Systems | Authors: | 陳健輝 Houle, M. E. Kuo, M. T. |
Issue Date: | 1993 | Journal Volume: | v.74 n.1+2 | Start page/Pages: | 73-96 | Source: | Information Sciences | Abstract: | A distributed algorithm is presented for constructing a nearly optimal Steiner tree in an asynchronous network represented by a weighted communication graph G = (V, E, c). The worst-case cost ratio of the obtained solution to any given minimum-cost Steiner tree Tmin is 2( 1-1 l), where l is the number of leaves of Tmin. The message complexity of the algorithm is O(|E| + |V|*(|V| + log|V|)) and the time complexity is O|V|*|V|), where S is the subset of nodes of G to be connected. © 1993. |
URI: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-0027684728&doi=10.1016%2f0020-0255%2893%2990128-9&partnerID=40&md5=a0d45cfadf408dcfa18fc304dc50f3a1 | DOI: | 10.1016/0020-0255(93)90128-9 | SDG/Keyword: | Algorithms; Computational complexity; Data communication systems; Data structures; Distributed computer systems; Network protocols; Optimization; Trees (mathematics); Asynchronous networks; Message complexity; Steiner trees; Time complexity; Weighted communication graphs; Worst case cost ratio; Graph theory |
Appears in Collections: | 資訊工程學系 |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.