A fast algorithm for Steiner trees
From MaRDI portal
Cites work
- A note on two problems in connexion with graphs
- All shortest distances in a graph. An improvement to Dantzig's inductive algorithm
- An \(0(| E|\log\log| V|)\) algorithm for finding minimum spanning trees
- Finding Minimum Spanning Trees
- scientific article; zbMATH DE number 3588048 (Why is no real title available?)
- On Steiner Minimal Trees with Rectilinear Distance
- Steiner Minimal Trees
Cited in
(79)- Combinatorial optimization in system configuration design
- Steiner problem in Halin networks
- Worst-case performance of Rayward-Smith's Steiner tree heuristic
- Fast heuristic algorithms for rectilinear Steiner trees
- 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
- The Steiner traveling salesman problem with online advanced edge blockages
- Efficient and effective community search
- Minimization of multicast traffic and ensuring its fault tolerance in software-defined networks
- Algorithms for multicast connection under multi-path routing model.
- Improved methods for approximating node weighted Steiner trees and connected dominating sets.
- Adaptive Hagen-Poiseuille flows on graphs
- Strategyproof auction mechanisms for network procurement
- The dynamic replica placement problem with service levels in content delivery networks: a model and a simulated annealing heuristic
- Reducing the diameter of a unit disk graph via node addition
- An 11/6-approximation algorithm for the network Steiner problem
- A survey of combinatorial optimization problems in multicast routing
- Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing
- QoS multicast routing protocol in hierarchical wireless MANET
- Worst-case performance of Wong's Steiner tree heuristic
- Informative labeling schemes for graphs
- Combination algorithms for Steiner tree variants
- An improved approximation scheme for the Group Steiner Problem
- The pilot method: a strategy for heuristic repetition with application to the Steiner problem in graphs
- Direction-controlled DTI interpolation
- 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
- Constrained relay node deployment for underwater acoustic wireless sensor networks
- A practical greedy approximation for the directed Steiner tree problem
- Using structured steiner trees for hierarchical global routing
- 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
- The influence of preprocessing on Steiner tree approximations
- Bandwidth-Delay Constrained Least Cost Multicast Routing for Multimedia Communication
- A super-stabilizing \(\log(n)\)-approximation algorithm for dynamic Steiner trees
- Light graphs with small routing cost
- A survey of repair methods used as constraint handling techniques in evolutionary algorithms
- Strong Steiner tree approximations in practice
- Minimum cost multicast routing using ant colony optimization algorithm
- The computation of nearly minimal Steiner trees in graphs
- RNC-approximation algorithms for the steiner problem
- Multicastad hocrouting through mobility-aware Steiner tree meshes with consistency across different mobility models
- Multi-shared-trees based multicast routing control protocol using anycast selection
- Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs
- scientific article; zbMATH DE number 2230205 (Why is no real title available?)
- Distributed approximation algorithms for Steiner tree in the CONGESTED CLIQUE
- A faster approximation algorithm for the Steiner problem in graphs
- A faster approximation algorithm for the Steiner problem in graphs
- Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View
- Steiner connectivity problems in hypergraphs
- Improved and deterministic online service with deadlines or delay
- On minimum spanning trees for random Euclidean bipartite graphs
- Massively parallel approximate Steiner tree algorithms
- Connecting de Bruijn graphs
- Survivable networks, linear programming relaxations and the parsimonious property
- Parameterized algorithms for \textsc{Steiner Forest} in bounded width graphs
- Approximate minimum tree cover in all symmetric monotone norms simultaneously
- Shortest undirected paths in de Bruijn graphs
- Models of greedy algorithms for graph problems
- Node-weighted Steiner tree approximation in unit disk graphs
- Sharing the cost of multicast transmissions in wireless networks
- Inapproximability and approximability of minimal tree routing and coloring
This page was built for publication: A fast algorithm for Steiner trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1145507)