Steiner problem in networks: A survey

Networks

Volumn 17, Issue 2, 1987, Pages 129-167

  Winter, Pawel ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84987034438     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.3230170203     Document Type: Article

References (92)

1. Rectilinear Steiner trees: efficient special case algorithms
2. An integer linear programming approach to the Steiner problem in graphs
3. An algorithm for the Steiner problem in graphs
4. On a routing problem
5. Set‐covering and involutary bases
6. An improved program for the full Steiner tree problems
7. The generation of minimal trees with a Steiner topology
8. Network synthesis with connectivity constraints‐a survey
9. On Steiner trees for bounded point sets
10. The largest minimal rectilinear Steiner trees for a set of n points enclosed in a rectangle with given perimeter
11. A note on two problems in connection with graphs
12. Exact and approximate algorithms for optimal network design
13. The Steiner problem in graphs
14. Une heuristique pour le probleme de l'arbre de Steiner. R.A.I.R.O
15. Characterization of strongly chordal graphs
16. Rectilinear Steiner trees in rectangle trees
17. The Lagrangian relaxation method for solving integer programming problems
18. Algorithm 97: Shortest path
19. Testing the theory of evolution
20. Algorithms for the Steiner problem in graphs
21. The Steiner problem in phylogeny is NP‐complete
22. Steiner problems in graphs: Algorithms and applications
23. Two algorithms for generating weighted spanning trees in order
24. The rectilinear Steiner problem is NP‐complete
25. Steiner minimal trees
26. Multi‐terminal network flows
27. Steiner's problem in graphs and its implications
28. On Steiner's problem with rectilinear distance
29. A counterexample to a theorem of Fu on Steiner's problem
30. Validation of subgradient optimization
31. System‐reliability evaluation: techniques for complex/large systems‐a review
32. On Steiner minimal trees with rectilinear distance
33. The rectilinear Steiner problem
34. An O(nlogn) algorithm for rectilinear minimal spanning trees
35. An O(nlogn) algorithm for suboptimal rectilinear Steiner trees
36. Reducibility among combinatorial problems
37. An algorithm for transforming a spanning tree into a Steiner tree
38. A fast algorithm for Steiner trees
39. On the shortest spanning subtree of a graph and the traveling salesman problem
40. Use of Steiner's problem in suboptimal routing in rectilinear metric
41. Algorithm for the shortest connection of a group of graph vertices
42. Network design and transportation planning: models and algorithms
43. Finding a minimum equivalent graph of a diagraph
44. On the problem of Steiner
45. Cost‐minimal trees in directed acyclic graphs
46. A bound for the Steiner tree problem in graphs
47. Shortest connection networks and some generalizations
48. The computation of nearly minimal Steiner trees in graphs
49. An efficiently solvable case of the minimum weight equivalent subgraph problem
50. Computationally related problems
51. An algorithm for the Steiner problem in graphs
52. An O(nlogn) heuristic for Steiner minimal tree problems on the Euclidean metric
53. An O(nlogn) heuristic algorithm for the rectilinear Steiner minimal tree problem
54. Steiner trees, Steiner circuits and the interference problem in building design
55. An approximate solution for the Steiner problem in graphs
56. The complexity of enumeration and reliability problem
57. Steiner trees in outerplanar graphs
58. Steiner trees, partial 2–trees and minimum IFI networks
59. Steiner trees, connected domination and strongly chordal graphs
60. An algorithm for the Steiner problem in the Euclidean plane
61. Generalized Steiner problem in outerplanar networks
62. Generalized Steiner problem in series‐parallel networks
63. A dual ascent approach for Steiner tree problems on a directed graph
64. Suboptimal algorithm for a wire routing problem