Optimum Communication Spanning Trees in Series-Parallel Networks
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3896955
- Algorithms for the optimum communication spanning tree problem
- Approximation algorithms for some optimum communication spanning tree problems
- A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem
- Optimum requirement spanning trees and reliability of tree networks
Cited in
(13)- Algorithms for the optimum communication spanning tree problem
- An explicit solution of a generalized optimum requirement spanning tree problem with a property related to Monge
- Constrained Optimum Communication Trees and Sensitivity Analysis
- Algorithms for solving the \(k\)-star hub problem for trees and series-parallel graphs
- scientific article; zbMATH DE number 3896955 (Why is no real title available?)
- Network Resilience
- A GENERALIZED OPTIMUM REQUIREMENT SPANNING TREE PROBLEM WITH A MONGE-LIKE PROPERTY
- scientific article; zbMATH DE number 2104813 (Why is no real title available?)
- Performance Oriented Spanning Trees
- scientific article; zbMATH DE number 867692 (Why is no real title available?)
- A survey of very large-scale neighborhood search techniques
- Parameterized algorithms for computing MAD trees
- A factoring approach for the Steiner tree problem in undirected networks
This page was built for publication: Optimum Communication Spanning Trees in Series-Parallel Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3694714)