Steiner problem in networks: A survey

The problem of determining a minimum cost connected network (i.e., weighted graph) G that spans a given subset of vertices is known in the literature as the Steiner problem in networks. We survey exact algorithms and heuristics which appeared in the published literature. We also discuss problems related to the Steiner problem in networks.

[1]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[2]  Frank K. Hwang,et al.  An O(n log n) Algorithm for Rectilinear Minimal Spanning Trees , 1979, JACM.

[3]  J. S. Lee,et al.  Use of steiner's problem in suboptimal routing in rectilinear metric , 1976 .

[4]  R. Graham,et al.  The steiner problem in phylogeny is NP-complete , 1982 .

[5]  J. Kruskal.  On the shortest spanning subtree of a graph and the traveling salesman problem , 1956 .

[6]  Alfred V. Aho,et al.  Rectilinear steiner trees: Efficient special-case algorithms , 1977, Networks.

[7]  S. Martello,et al.  Finding a minimum equivalent graph of a digraph , 1982, Networks.

[8]  S. Louis Hakimi,et al.  Steiner's problem in graphs and its implications , 1971, Networks.

[9]  J. MacGregor Smith,et al.  STEINER TREES, STEINER CIRCUITS AND THE INTERFERENCE PROBLEM IN BUILDING DESIGN , 1979 .

[10]  John E. Beasley.  An algorithm for the steiner problem in graphs , 1984, Networks.

[11]  Arthur M. Farley,et al.  Rectilinear Steiner Trees in Rectangle Trees , 1980, SIAM J. Algebraic Discret. Methods.

[12]  Sartaj Sahni,et al.  Computationally Related Problems , 1974, SIAM J. Comput..

[13]  Fan Chung Graham,et al.  The largest minimal rectilinear steiner trees for a set of n points enclosed in a rectangle with given perimeter , 1979, Networks.

[14]  D. T. Lee,et al.  An O(n log n) heuristic for steiner minimal tree problems on the euclidean metric , 1981, Networks.

[15]  R. Graham,et al.  On Steiner trees for bounded point sets , 1981 .

[16]  Frank A. Tillman,et al.  System-Reliability Evaluation Techniques for Complex/Large SystemsߞA Review , 1981, IEEE Transactions on Reliability.

[17]  S. E. Dreyfus,et al.  The steiner problem in graphs , 1971, Networks.

[18]  Harold N. Gabow,et al.  Two Algorithms for Generating Weighted Spanning Trees in Order , 1977, SIAM J. Comput..

[19]  William M. Boyce,et al.  An Improved Program for the Full Steiner Tree Problem , 1977, TOMS.

[20]  H. D. Ratliff,et al.  Set Covering and Involutory Bases , 1971 .

[21]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[22]  Victor J. Rayward-Smith,et al.  Steiner problems in graphs: algorithms and applications , 1983 .

[23]  Martin Farber,et al.  Characterizations of strongly chordal graphs , 1983, Discret. Math..

[24]  Yash P. Aneja,et al.  An integer linear programming approach to the steiner problem in graphs , 1980, Networks.

[25]  O. Wing,et al.  Suboptimal algorithm for a wire routing problem , 1972 .

[26]  Z. A. Melzak.  On the Problem of Steiner , 1961, Canadian Mathematical Bulletin.

[27]  David S. Johnson,et al.  The Rectilinear Steiner Tree Problem is NP Complete , 1977, SIAM Journal of Applied Mathematics.

[28]  Thomas L. Magnanti,et al.  Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..

[29]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

[30]  Pawel Winter,et al.  Generalized steiner problem in outerplanar networks , 1985, BIT.

[31]  M. Hanan.  A Counterexample to a Theorem of Fu on Steiner's Problem , 1972 .

[32]  Pawel Winter,et al.  An algorithm for the steiner problem in the euclidean plane , 1985, Networks.

[33]  J. Plesník.  A bound for the Steiner tree problem in graphs , 1981 .

[34]  Ronald L. Rardin,et al.  An efficiently solvable case of the minimum weight equivalent subgraph problem , 1985, Networks.

[35]  H. Pollak,et al.  Steiner Minimal Trees , 1968 .

[36]  F. Hwang,et al.  An o(nlogn) algorithm for suboptimal rectilinear steiner trees , 1979 .

[37]  Martin Farber,et al.  Steiner trees, connected domination and strongly chordal graphs , 1985, Networks.

[38]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[39]  Michael Florian,et al.  Exact and approximate algorithms for optimal network design , 1979, Networks.

[40]  Choukhmane El-Arbi.  Une heuristique pour le problème de l'arbre de Steiner , 1978 .

[41]  Ludwig Nastansky,et al.  Cost-minimal trees in directed acyclic graphs , 1974, Z. Oper. Research.

[42]  Charles J. Colbourn,et al.  Steiner trees, partial 2-trees, and minimum IFI networks , 1983, Networks.

[43]  Richard Bellman,et al.  ON A ROUTING PROBLEM , 1958 .

[44]  F. Hwang.  On Steiner Minimal Trees with Rectilinear Distance , 1976 .

[45]  V. J. Rayward-Smith,et al.  The computation of nearly minimal Steiner trees in graphs , 1983 .

[46]  Der-Tsai Lee,et al.  An O(n log n) Heuristic Algorithm for the Rectilinear Steiner Minimal Tree Problem , 1980 .

[47]  Joseph A. Wald,et al.  Steiner trees in probabilistic networks , 1983 .

[48]  Victor J. Rayward-Smith,et al.  On finding steiner vertices , 1986, Networks.

[49]  Peter B. Gibbons,et al.  An algorithm for the steiner problem in graphs , 1982, Networks.

[50]  Richard T. Wong,et al.  A dual ascent approach for steiner tree problems on a directed graph , 1984, Math. Program..

[51]  R. Prim.  Shortest connection networks and some generalizations , 1957 .

[52]  Shi-Kuo Chang,et al.  The Generation of Minimal Trees with a Steiner Topology , 1972, JACM.

[53]  Arie Segev,et al.  The node-weighted steiner tree problem , 1987, Networks.

[54]  M. Hanan,et al.  On Steiner’s Problem with Rectilinear Distance , 1966 .

[55]  Pawel Winter.  Steiner problem in Halin networks , 1987, Discret. Appl. Math..