Diameter-constrained Steiner tree
From MaRDI portal
Recommendations
- Minimum diameter cost-constrained Steiner trees
- On the minimum diameter cost-constrained Steiner tree problem
- When diameter matters: parameterized approximation algorithms for bounded diameter minimum Steiner tree problem
- Minimum diameter vertex-weighted Steiner tree
- Minimum restricted diameter spanning trees.
Cited in
(16)- Approximating the weight of shallow Steiner trees
- Minimum diameter vertex-weighted Steiner tree
- A 2-approximation algorithm and beyond for the minimum diameter k-Steiner forest problem
- Minimum diameter cost-constrained Steiner trees
- Bounded-diameter minimum-cost graph problems
- When diameter matters: parameterized approximation algorithms for bounded diameter minimum Steiner tree problem
- An algorithm to find the link constrained Steiner tree in undirected graphs
- Diameter-constrained Steiner trees
- A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees
- On the minimum diameter cost-constrained Steiner tree problem
- Vertex fusion under diameter constraints
- Dynamic Steiner Tree Problem
- scientific article; zbMATH DE number 731844 (Why is no real title available?)
- A Lagrangean-based decomposition approach for the link constrained Steiner tree problem
- Algorithms for the minimum diameter terminal Steiner tree problem
- Minimum diameter \(k\)-Steiner forest
This page was built for publication: Diameter-constrained Steiner tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3066462)