Steiner tree problems in telecommunications
From MaRDI portal
Recommendations
Cited in
(22)- The telephonic switching centre network problem: Formalization and computational experience
- A constrained Steiner tree problem
- The Steiner tree in \(K_{1,r}\)-free split graphs -- a dichotomy
- Breakout local search for the Steiner tree problem with revenue, budget and hop constraints
- The dynamic replica placement problem with service levels in content delivery networks: a model and a simulated annealing heuristic
- Variable neighbourhood search for the minimum labelling Steiner tree problem
- Complexity of Steiner tree in split graphs -- dichotomy results
- Optimal capacitated ring trees
- Steiner problems with limited number of branching nodes
- A practical greedy approximation for the directed Steiner tree problem
- Graphs and algorithms in communication networks on seven league boots
- Directed Steiner trees with diffusion costs
- A practical greedy approximation for the directed Steiner tree problem
- Steiner problem in networks: A survey
- A solvable routing problem
- Optimal network design with end-to-end service requirements
- An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes
- Solving Steiner trees: Recent advances, challenges, and perspectives
- The parameterized complexity of the survivable network design problem
- Parameterized algorithms for Steiner forest in bounded width graphs
- Parameterized algorithms for \textsc{Steiner Forest} in bounded width graphs
- A new approach for approximating directed rooted networks
This page was built for publication: Steiner tree problems in telecommunications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5294062)
