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
Light graphs with small routing cost, Unnamed Item, Survivable networks, linear programming relaxations and the parsimonious property, 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, Class Steiner trees and VLSI-design, Neural and delay based heuristics for the Steiner problem in networks, The Steiner problem in distributed computing systems, Worst-case performance of some heuristics for Steiner's problem in directed graphs, A primal-dual approximation algorithm for the Steiner forest problem, A data structure for bicategories, with application to speeding up an approximation algorithm, Distributed multicast routing in point-to-point networks, Solving group Steiner problems as Steiner problems., Multiple multicast tree allocation in IP network., Spanners and message distribution in networks., Recent results on approximating the Steiner tree problem and its generalizations, Algorithms for multicast connection under multi-path routing model., Improved methods for approximating node weighted Steiner trees and connected dominating sets., An 11/6-approximation algorithm for the network Steiner problem, A survey of combinatorial optimization problems in multicast routing, Informative labeling schemes for graphs, Unnamed Item, Unnamed Item
Uses Software
