An algorithm for the steiner problem in graphs
From MaRDI portal
Publication:5902589
DOI10.1002/net.3230120309zbMath0514.05036OpenAlexW2115616619MaRDI QIDQ5902589
M. L. Shore, Les R. Foulds, Peter B. Gibbons
Publication date: 1982
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230120309
Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)
Related Items
Steiner problem in Halin networks, Network construction problems with due dates, Node-weighted Steiner tree approximation in unit disk graphs, Fast heuristic algorithms for rectilinear Steiner trees, A factoring approach for the Steiner tree problem in undirected networks, An exact branch and bound algorithm for the Steiner Problem in Graphs, Lateness Minimization in Pairwise Connectivity Restoration Problems, Strong Steiner Tree Approximations in Practice, Branch-and-bound as a higher-order function, Path-distance heuristic for the Steiner problem in undirected networks, Heuristic algorithms for packing of multiple-group multicasting, Computing optimal rectilinear Steiner trees: A survey and experimental evaluation, Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs, Efficiency considerations in the implementation of parallel branch-and- bound
Cites Work
