A fast algorithm for Steiner trees
From MaRDI portal
Publication:1145507
DOI10.1007/BF00288961zbMath0445.68051MaRDI QIDQ1145507
Publication date: 1981
Published in: Acta Informatica (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
05C05: Trees
68R10: Graph theory (including graph drawing) in computer science
Related Items
A note on A faster approximation algorithm for the Steiner problem in graphs, The multi-weighted Steiner tree problem, The role of Steiner hulls in the solution to Steiner tree problems, Path-distance heuristic for the Steiner problem in undirected networks, Heuristics for the Steiner problem in graphs, Steiner's problem in graphs: Heuristic methods, Efficient methods for multiple sequence alignment with guaranteed error bounds, An 11/6-approximation algorithm for the network Steiner problem
Uses Software