Elsevier

Information Sciences

Volume 74, Issues 1–2, 15 October 1993, Pages 73-96
Information Sciences

The steiner problem in distributed computing systems

https://doi.org/10.1016/0020-0255(93)90128-9Get rights and content

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−1l), 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.

References (23)

  • K.B. Lakshmanan et al.

    A time-optimal messageefficient distributed algorithm for depth-first-search

    Inform. Process. Lett.

    (1987)
  • I. Lavallee et al.

    A fully distributed (minimal) spanning tree algorithm

    Inform. Process. Lett.

    (1986)
  • B. Awerbuch

    Complexity of network synchronization

    J. ACM

    (Oct. 1985)
  • B. Awerbuch

    Optimal distributed algorithms for minimum weight spanning tree, counting, leader election and related problems

  • B. Awerbuch et al.

    Dynamic deadlock resolution protocols

  • F. Chin et al.

    An almost linear time and O(n log n + e) messages distributed algorithm for minimum-weight spanning trees

  • I.A. Cimet et al.

    A resilient distributed algorithm for minimum-weight spanning trees

  • Y.K. Dalal

    A distributed algorithm for constructing minimal spanning trees

    IEEE Trans. Software Eng.

    (Mar. 1987)
  • Y.K. Dalal et al.

    Reserve path forwarding of broadcast packets

    Comm. ACM

    (Dec. 1978)
  • N. Deo

    Graph Theory with Applications to Engineering and Computer Science

    (1974)
  • E.W. Dijkstra

    A note on two problems in connexion with graphs

    Numer. Math.

    (1959)
  • Cited by (0)

    View full text