The following pages link to Steiner tree problems (Q5966604):
Displaying 46 items.
- Optimal capacitated ring trees (Q286687) (← links)
- Looking for edge-equitable spanning trees (Q336753) (← links)
- A simulated annealing based genetic local search algorithm for multi-objective multicast routing problems (Q363596) (← links)
- New formulations of the hop-constrained minimum spanning tree problem via Miller-Tucker-Zemlin constraints (Q421519) (← links)
- SoMR: a scalable distributed QoS multicast routing protocol (Q436654) (← links)
- Optimal design of virtual links in AFDX networks (Q483956) (← links)
- On the parameterized complexity of finding separators with non-hereditary properties (Q494799) (← links)
- The Steiner tree problem with delays: a compact formulation and reduction procedures (Q496653) (← links)
- New approximations for minimum-weighted dominating sets and minimum-weighted connected dominating sets on unit disk graphs (Q621836) (← links)
- Tree network design avoiding congestion (Q646180) (← links)
- Non delayed relax-and-cut algorithms (Q817212) (← links)
- On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane \(\mathbb{R}^2\) (Q828689) (← links)
- Reoptimization of Steiner trees: changing the terminal set (Q838156) (← links)
- A factoring approach for the Steiner tree problem in undirected networks (Q881873) (← links)
- Steiner minimal trees for three points with one convex polygonal obstacle (Q1179763) (← links)
- A heuristic for Euclidean and rectilinear Steiner problems (Q1194744) (← links)
- Heuristics for the Steiner problem in graphs (Q1199447) (← links)
- A fast and simple Steiner routing heuristic (Q1276958) (← links)
- Fixed topology Steiner trees and spanning forests (Q1285596) (← links)
- Worst-case performance of some heuristics for Steiner's problem in directed graphs (Q1313772) (← links)
- Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs (Q1315998) (← links)
- A neural network for the Steiner minimal tree problem (Q1323577) (← links)
- A primal-dual approximation algorithm for the Steiner forest problem (Q1327312) (← links)
- Rectilinear Steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors (Q1343464) (← links)
- On the Steiner ratio in 3-space (Q1345879) (← links)
- Cut and patch Steiner trees for ladders (Q1356409) (← links)
- The Steiner tree problem in orientation metrics (Q1384537) (← links)
- On shortest three-edge-connected Steiner networks with Euclidean distance (Q1570830) (← links)
- A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints (Q1694297) (← links)
- The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study (Q1741111) (← links)
- Two variations of the minimum Steiner problem (Q1774532) (← links)
- Minimization of multicast traffic and ensuring its fault tolerance in software-defined networks (Q1792411) (← links)
- The Steiner cycle polytope (Q1873013) (← links)
- Routing algorithm for multicast under multi-tree model in optical networks (Q1884928) (← links)
- Steiner minimal trees on regular polygons with centre (Q1894775) (← links)
- A heuristic for the Steiner problem in graphs (Q1918915) (← links)
- Approximation algorithms for tree alignment with a given phylogeny (Q1924406) (← links)
- A note on the generalized Steiner tree polytope (Q1962028) (← links)
- On approximations for constructing 1-line minimum rectilinear Steiner trees in the Euclidean plane \(\mathbb{R}^2\) (Q2039643) (← links)
- \(1\)-line minimum rectilinear Steiner trees and related problems (Q2084647) (← links)
- Approximation algorithms for solving the line-capacitated minimum Steiner tree problem (Q2089871) (← links)
- Multicast routing under quality of service constraints for vehicular ad hoc networks: mathematical formulation and a relax‐and‐fix heuristic (Q6066592) (← links)
- Solving Steiner trees: Recent advances, challenges, and perspectives (Q6087073) (← links)
- Structural properties of minimum multi-source multi-sink Steiner networks in the Euclidean plane (Q6167087) (← links)
- Robust optimization for minimizing energy consumption of multicast transmissions in coded wireless packet networks under distance uncertainty (Q6176403) (← links)
- (Q6179336) (← links)
