The following pages link to Steiner tree problems (Q5966604):
Displaying 38 items.
- Finding outbreak trees in networks with limited information (Q2357924) (← links)
- Population-driven urban road evolution dynamic model (Q2358046) (← links)
- A survey of combinatorial optimization problems in multicast routing (Q2387246) (← links)
- On the set of extreme core allocations for minimal cost spanning tree problems (Q2397642) (← links)
- The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches (Q2427392) (← links)
- Approximations for two variants of the Steiner tree problem in the Euclidean plane \(\mathbb R^2\) (Q2434638) (← links)
- Minimum cost spanning tree problems with indifferent agents (Q2442831) (← links)
- Effective multicasting algorithm for dynamic membership with delay constraint (Q2508107) (← links)
- Towards optimizing the deployment of optical access networks (Q2513732) (← links)
- Rectilinear paths among rectilinear obstacles (Q2563920) (← links)
- Combination algorithms for Steiner tree variants (Q2700384) (← links)
- An Algorithm to Find the Link Constrained Steiner Tree in Undirected Graphs (Q2819269) (← links)
- Diameter-constrained Steiner trees (Q2905280) (← links)
- Optimal Competitiveness for the Rectilinear Steiner Arborescence Problem (Q3449515) (← links)
- Approaches to the Steiner Problem in Networks (Q3637313) (← links)
- The 1-steiner tree problem (Q3783604) (← links)
- Problem reduction methods and a tree generation algorithm for the steiner network problem (Q3786299) (← links)
- Dynamic Steiner Tree Problem (Q3977293) (← links)
- An integer programming formulation of the Steiner problem in graphs (Q4031973) (← links)
- Constrained Steiner trees in Halin graphs (Q4467896) (← links)
- Growing Half-Balls: Minimizing Storage and Communication Costs in Content Delivery Networks (Q4578010) (← links)
- A Lagrangean-based decomposition approach for the link constrained Steiner tree problem (Q4637834) (← links)
- How to Infer Ancestral Genome Features by Parsimony: Dynamic Programming over an Evolutionary Tree (Q4992754) (← links)
- Multi-Level Steiner Trees. (Q5140725) (← links)
- (Q5689037) (← links)
- A note on distributed multicast routing in point-to-point networks (Q5945321) (← links)
- A branch-and-price algorithm for the Steiner tree packing problem. (Q5952785) (← links)
- Approximations for Steiner trees with minimum number of Steiner points (Q5958113) (← links)
- Heuristic algorithms for packing of multiple-group multicasting (Q5959379) (← 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)
- The average Steiner \(( 3 , 2 )\)-eccentricity of trees (Q6559393) (← links)
- Fully dynamic algorithms for Euclidean Steiner tree (Q6575381) (← links)
- Approximation algorithms for solving the 1-line minimum Steiner tree of line segments problem (Q6601971) (← links)
- The parameterized complexity of the survivable network design problem (Q6655676) (← links)
