Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/wiley/steiner-problem-in-networks-a-survey-yQisKmQb0n
References (67)
-
M. Richey, R. Parker, R. Rardin (1985)
An efficiently solvable case of the minimum weight equivalent subgraph problemNetworks, 15
-
R. Karp (1972)
Reducibility Among Combinatorial Problems -
H. Gabow (1977)
Two Algorithms for Generating Weighted Spanning Trees in OrderSIAM J. Comput., 6
-
R. Bellman (1958)
ON A ROUTING PROBLEMQuarterly of Applied Mathematics, 16
-
L. Valiant (1979)
The Complexity of Enumeration and Reliability ProblemsSIAM J. Comput., 8
-
L. Nastansky, S. Selkow, N. Stewart (1974)
Cost-minimal trees in directed acyclic graphsZeitschrift für Operations Research, 18
-
S. Martello, P. Toth (1982)
Finding a minimum equivalent graph of a digraphNetworks, 12
-
R. Dionne, M. Florian (1979)
Exact and approximate algorithms for optimal network designNetworks, 9
-
F. Hwang (1979)
An O(n log n) Algorithm for Rectilinear Minimal Spanning TreesJ. ACM, 26
-
L. Foulds, R. Graham (1982)
The steiner problem in phylogeny is NP-completeAdvances in Applied Mathematics, 3
-
M. Farber (1983)
Characterizations of strongly chordal graphsDiscret. Math., 43
-
J.M.Smith, Der-Tsai Lee, J. Liebman (1980)
An O(n log n) Heuristic Algorithm for the Rectilinear Steiner Minimal Tree ProblemEngineering Optimization, 4
-
S. Dreyfus, Robert Wagner (1971)
The steiner problem in graphsNetworks, 1
-
A. Segev (1987)
The node-weighted steiner tree problemNetworks, 17
-
S. Sahni (1974)
Computationally Related ProblemsSIAM J. Comput., 3
-
F. Hwang (1976)
On Steiner Minimal Trees with Rectilinear DistanceSiam Journal on Applied Mathematics, 30
-
A. Farley, S. Hedetniemi, S. Hedetniemi (1980)
Rectilinear Steiner Trees in Rectangle TreesSIAM J. Algebraic Discret. Methods, 1
-
Author Hanan, M. HANANt (1966)
On Steiner’s Problem with Rectilinear DistanceSiam Journal on Applied Mathematics, 14
-
V. Rayward-Smith (1983)
The computation of nearly minimal Steiner trees in graphsInternational Journal of Mathematical Education in Science and Technology, 14
-
M. Hanan (1972)
A Counterexample to a Theorem of Fu on Steiner's ProblemIEEE Transactions on Circuit Theory, 19
-
R. Prim (1957)
Shortest connection networks and some generalizationsBell System Technical Journal, 36
-
F. Hwang (1979)
An o(nlogn) algorithm for suboptimal rectilinear steiner treesCybernetics and Systems
-
Fisher Fisher (1981)
The Lagrangian relaxation method for solving integer programming problemsMan. Sci., 27
-
Foulds Foulds (1983)
Testing the theory of evolutionOptima, 10
-
J. Lee, N. Bose, F. Hwang (1976)
Use of steiner's problem in suboptimal routing in rectilinear metric -
David Johnson, W. Freeman
The Np-completeness Column: an Ongoing Guide Garey and Myself in Our Book ''computers and Intractability: a Guide to the Theory of Np-completeness,'' -
Joseph Wald, C. Colbourn (1983)
Steiner trees, partial 2-trees, and minimum IFI networksNetworks, 13
-
W. Boyce (1977)
An Improved Program for the Full Steiner Tree ProblemACM Trans. Math. Softw., 3
-
V. Rayward-Smith, A. Clare (1986)
On finding steiner verticesNetworks, 16
-
R. Wong (1984)
A dual ascent approach for steiner tree problems on a directed graphMathematical Programming, 28
-
Y. Yang, O. Wing (1972)
Suboptimal algorithm for a wire routing problemIEEE Transactions on Circuit Theory, 19
-
Joseph Wald, C. Colbourn (1983)
Steiner trees in probabilistic networksMicroelectronics Reliability, 23
-
J. Kruskal (1956)
On the shortest spanning subtree of a graph and the traveling salesman problem, 7
-
F. Graham, Frank Hwang (1979)
The largest minimal rectilinear steiner trees for a set of n points enclosed in a rectangle with given perimeterNetworks, 9
-
L. Foulds, V. Rayward-Smith (1983)
Steiner problems in graphs: algorithms and applicationsEngineering Optimization, 7
-
J. Smith, J. Liebman (1979)
STEINER TREES, STEINER CIRCUITS AND THE INTERFERENCE PROBLEM IN BUILDING DESIGNEngineering Optimization, 4
-
M. Shore, L. Foulds, P. Gibbons (1982)
An algorithm for the steiner problem in graphsNetworks, 12
-
F. Chung, R. Graham (1981)
On Steiner trees for bounded point setsGeometriae Dedicata, 11
-
M. Garey, David Johnson (1977)
The Rectilinear Steiner Tree Problem is NP CompleteSIAM Journal of Applied Mathematics, 32
-
Levin Levin (1971)
Algorithm for the shortest connection of a group of graph verticesSoviet Math. Dokl., 12
-
Y. Aneja (1980)
An integer linear programming approach to the steiner problem in graphsNetworks, 10
-
Shi-Kuo Chang (1972)
The Generation of Minimal Trees with a Steiner TopologyJ. ACM, 19
-
E. Gilbert, H. Pollak (1968)
Steiner Minimal TreesSiam Journal on Applied Mathematics, 16
-
J. Plesník (1981)
A bound for the Steiner tree problem in graphsMathematica Slovaca, 31
-
M. Bellmore, H. Ratliff (1971)
Set Covering and Involutory BasesManagement Science, 18
-
P. Winter (1987)
Steiner problem in Halin networksDiscret. Appl. Math., 17
-
C. Hwang, F. Tillman, M. Lee (1981)
System-Reliability Evaluation Techniques for Complex/Large SystemsߞA ReviewIEEE Transactions on Reliability, R-30
-
T. Magnanti, R. Wong (1984)
Network Design and Transportation Planning: Models and AlgorithmsTransp. Sci., 18
-
S. Hakimi (1971)
Steiner's problem in graphs and its implicationsNetworks, 1
-
El‐Arbi El‐Arbi (1978)
Une heuristique pour le probleme de l'arbre de Steiner. R.A.I.R.OOperations Research, 12
-
Z. Melzak (1961)
On the Problem of SteinerCanadian Mathematical Bulletin, 4
-
K. White, M. Farber, W. Pulleyblank (1985)
Steiner trees, connected domination and strongly chordal graphsNetworks, 15
-
A. Aho, M. Garey, F. Hwang (1977)
Rectilinear steiner trees: Efficient special-case algorithmsNetworks, 7
-
R. Floyd (1962)
Algorithm 97: Shortest pathCommunications of the ACM, 5
-
Gomory Gomory, Hu Hu (1961)
Multi‐terminal network flowsJ. SIAM, 9
-
Hwang Hwang (1979)
An O(nlogn ) algorithm for suboptimal rectilinear Steiner treesIEEE Trans. Circuits Systems, CAS‐26
-
P. Winter (1985)
An algorithm for the steiner problem in the euclidean planeNetworks, 15
-
Kou Kou, Markowsky Markowsky, Berman Berman (1981)
A fast algorithm for Steiner treesActa Informatica, 15
-
Takahashi Takahashi, Matsuyama Matsuyama (1980)
An approximate solution for the Steiner problem in graphsMath. Japonica, 24
-
J. Smith, D. Lee, J. Liebman (1981)
An O(n log n) heuristic for steiner minimal tree problems on the euclidean metricNetworks, 11
-
E. Dijkstra (1959)
A note on two problems in connexion with graphsNumerische Mathematik, 1
-
Wald Wald, Colbourn Colbourn (1982)
Steiner trees in outerplanar graphsCongr. Numerantium, 36
-
Hwang Hwang (1978)
The rectilinear Steiner problemJ. Design Automation Fault Tolerance Anal., 2
-
P. Winter (1985)
Generalized steiner problem in outerplanar networksBIT Numerical Mathematics, 25
-
M. Held, P. Wolfe, H. Crowder (1974)
Validation of subgradient optimizationMathematical Programming, 6
-
Choukhmane El-Arbi (1978)
Une heuristique pour le problème de l'arbre de SteinerRairo-operations Research, 12
-
Winter Winter
Generalized Steiner problem in series‐parallel networksJ. Algorithms.
- Publisher
- Wiley
- Copyright
- Copyright © 1987 Wiley Periodicals, Inc., A Wiley Company
- ISSN
- 0028-3045
- eISSN
- 1097-0037
- DOI
- 10.1002/net.3230170203
- Publisher site
- See Article on Publisher Site
Abstract
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.
Journal
Networks: An International Journal – Wiley
Published: Jan 1, 1987