A fast algorithm for Steiner trees
From MaRDI portal
Publication:1145507
DOI10.1007/BF00288961zbMath0445.68051OpenAlexW1975290397MaRDI QIDQ1145507
Publication date: 1981
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00288961
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)
Related Items
A primal-dual approximation algorithm for the Steiner forest problem, An 11/6-approximation algorithm for the network Steiner problem, Models of greedy algorithms for graph problems, RNC-approximation algorithms for the steiner problem, A data structure for bicategories, with application to speeding up an approximation algorithm, Light graphs with small routing cost, Steiner problem in Halin networks, CONSTRAINED RELAY NODE DEPLOYMENT FOR UNDERWATER ACOUSTIC WIRELESS SENSOR NETWORKS, Node-weighted Steiner tree approximation in unit disk graphs, Adaptive Hagen-Poiseuille flows on graphs, A survey of combinatorial optimization problems in multicast routing, The Steiner traveling salesman problem with online advanced edge blockages, The Influence of Preprocessing on Steiner Tree Approximations, Distributed multicast routing in point-to-point networks, Sharing the cost of multicast transmissions in wireless networks, On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree, Directed Steiner trees with diffusion costs, A practical greedy approximation for the directed Steiner tree problem, Worst-case performance of Rayward-Smith's Steiner tree heuristic, Fast heuristic algorithms for rectilinear Steiner trees, An improved approximation scheme for the Group Steiner Problem, A Practical Greedy Approximation for the Directed Steiner Tree Problem, A super-stabilizing \(\log(n)\)-approximation algorithm for dynamic Steiner trees, Steiner connectivity problems in hypergraphs, Combination algorithms for Steiner tree variants, Solving group Steiner problems as Steiner problems., Efficient and effective community search, Strategyproof auction mechanisms for network procurement, A survey of repair methods used as constraint handling techniques in evolutionary algorithms, Multiple multicast tree allocation in IP network., Spanners and message distribution in networks., The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs, Minimum cost multicast routing using ant colony optimization algorithm, Strong Steiner Tree Approximations in Practice, 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, Inapproximability and approximability of minimal tree routing and coloring, Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing, Path-distance heuristic for the Steiner problem in undirected networks, Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View, Heuristics for the Steiner problem in graphs, Survivable networks, linear programming relaxations and the parsimonious property, Steiner's problem in graphs: Heuristic methods, Efficient methods for multiple sequence alignment with guaranteed error bounds, A faster approximation algorithm for the Steiner problem in graphs, A faster approximation algorithm for the Steiner problem in graphs, QoS multicast routing protocol in hierarchical wireless MANET, The dynamic replica placement problem with service levels in content delivery networks: a model and a simulated annealing heuristic, Worst-case performance of Wong's Steiner tree heuristic, Using structured steiner trees for hierarchical global routing, Minimization of multicast traffic and ensuring its fault tolerance in software-defined networks, Direction-Controlled DTI Interpolation, Bandwidth-Delay Constrained Least Cost Multicast Routing for Multimedia Communication, Multicastad hocrouting through mobility-aware Steiner tree meshes with consistency across different mobility models, Combinatorial optimization in system configuration design, Class Steiner trees and VLSI-design, Recent results on approximating the Steiner tree problem and its generalizations, Unnamed Item, Multi-shared-trees based multicast routing control protocol using anycast selection, Informative labeling schemes for graphs, Neural and delay based heuristics for the Steiner problem in networks, Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs, The computation of nearly minimal Steiner trees in graphs, Algorithms for multicast connection under multi-path routing model., Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE, Improved methods for approximating node weighted Steiner trees and connected dominating sets., The Steiner problem in distributed computing systems, Worst-case performance of some heuristics for Steiner's problem in directed graphs, Steiner Problems with Limited Number of Branching Nodes, Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming, Reducing the diameter of a unit disk graph via node addition
Uses Software
Cites Work
- Unnamed Item
- A note on two problems in connexion with graphs
- An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees
- All shortest distances in a graph. An improvement to Dantzig's inductive algorithm
- On Steiner Minimal Trees with Rectilinear Distance
- Finding Minimum Spanning Trees
- Steiner Minimal Trees
