Optimum Communication Spanning Trees
From MaRDI portal
Cited in
(55)- The zoo of tree spanner problems
- An initial study of budgeted Steiner networks
- Geometric spanning trees minimizing the Wiener index
- Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links
- An algorithm for the most economic link addition in a tree communications network
- On the approximability of the minimum strictly fundamental cycle basis problem
- Parallel construction of multiple independent spanning trees on highly scalable datacenter networks
- Multi-source spanning trees: Algorithms for minimizing source eccentricities.
- Solving the optimum communication spanning tree problem
- Designing a road network for hazardous materials shipments
- A tight bound on approximating arbitrary metrics by tree metrics
- The tree of hubs location problem
- Bounded-degree light approximate shortest-path trees in doubling metrics
- New valid inequalities for the optimal communication spanning tree problem
- Reload cost trees and network design
- Communication tree problems
- Optimization realization of a distance matrix †
- Ordered weighted average optimization in multiobjective spanning tree problem
- Using petal-decompositions to build a low stretch spanning tree
- An improved algorithm for the k-source maximum eccentricity spanning trees
- Bilinear matrix equation characterizes Laplacian and distance matrices of weighted trees
- Exact algorithms for minimum routing cost trees
- A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem
- Low complexity variants of the arrow distributed directory
- Tight bounds from a path based formulation for the tree of hub location problem
- General network design: a unified view of combined location and network design problems
- The complexity of minimizing certain cost metrics for k-source spanning trees.
- When do Gomory-Hu subtrees exist?
- A PTAS for the metric case of the optimum weighted source-destination communication spanning tree problem
- Combined column-and-row-generation for the optimal communication spanning tree problem
- Data analysis implications of some concepts related to the cuts of a graph
- Models and algorithms for network reduction
- Network design for time‐constrained delivery
- Approximation algorithms for the shortest total path length spanning tree problem
- The minimum flow cost Hamiltonian cycle problem: a comparison of formulations
- Deriving compact extended formulations via LP-based separation techniques
- Exact approaches for the minimum subgraph diameter problem
- scientific article; zbMATH DE number 7561370 (Why is no real title available?)
- \(k\)-outerplanar graphs, planar duality, and low stretch spanning trees
- Minimax flow tree problems
- Proof of a conjecture about minimum spanning tree cycle intersection
- Hardness and approximation for the star \(p\)-hub routing cost problem in metric graphs
- Optimal design of switched Ethernet networks implementing the multiple spanning tree protocol
- Optimization in telecommunication networks
- On the intercluster distance of a tree metric
- Approximation algorithms for some optimum communication spanning tree problems
- On the complexity of edge labelings for trees
- Wiener index of the tensor product of cycles
- Compact vs. exponential-size LP relaxations
- Approximation algorithms for the optimal \(p\)-source communication spanning tree
- Social distancing network creation
- Light graphs with small routing cost
- Deriving compact extended formulations via LP-based separation techniques
- The minimum routing cost tree problem. State of the art and a core-node based heuristic algorithm
- Geometric spanning trees minimizing the Wiener index
This page was built for publication: Optimum Communication Spanning Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3212880)
