Pages that link to "Item:Q3212880"

The following pages link to Optimum Communication Spanning Trees (Q3212880):

Displaying 50 items.

• Models and algorithms for network reduction (Q320811) (← links)
• On the approximability of the minimum strictly fundamental cycle basis problem (Q629358) (← links)
• \(k\)-outerplanar graphs, planar duality, and low stretch spanning trees (Q634672) (← links)
• Tight bounds from a path based formulation for the tree of hub location problem (Q833527) (← links)
• Designing a road network for hazardous materials shipments (Q853892) (← links)
• On the intercluster distance of a tree metric (Q861256) (← links)
• Communication tree problems (Q995575) (← links)
• The tree of hubs location problem (Q1039782) (← links)
• On the complexity of edge labelings for trees (Q1161294) (← links)
• Data analysis implications of some concepts related to the cuts of a graph (Q1237024) (← links)
• An algorithm for the most economic link addition in a tree communications network (Q1259541) (← links)
• The complexity of minimizing certain cost metrics for \(k\)-source spanning trees. (Q1408818) (← links)
• Multi-source spanning trees: Algorithms for minimizing source eccentricities. (Q1427201) (← links)
• Approximation algorithms for some optimum communication spanning tree problems (Q1566575) (← links)
• Approximation algorithms for the shortest total path length spanning tree problem (Q1582085) (← links)
• Low complexity variants of the arrow distributed directory (Q1604202) (← links)
• Compact vs. exponential-size LP relaxations (Q1612003) (← links)
• Combined column-and-row-generation for the optimal communication spanning tree problem (Q1652585) (← links)
• Optimal design of switched Ethernet networks implementing the multiple spanning tree protocol (Q1686055) (← links)
• Ordered weighted average optimization in multiobjective spanning tree problem (Q1753508) (← links)
• Approximation algorithms for the optimal \(p\)-source communication spanning tree (Q1887037) (← links)
• An improved algorithm for the \(k\)-source maximum eccentricity spanning trees (Q1887071) (← links)
• General network design: a unified view of combined location and network design problems (Q1926688) (← links)
• Solving the optimum communication spanning tree problem (Q1991267) (← links)
• Exact approaches for the minimum subgraph diameter problem (Q2108148) (← links)
• Proof of a conjecture about minimum spanning tree cycle intersection (Q2172386) (← links)
• Bilinear matrix equation characterizes Laplacian and distance matrices of weighted trees (Q2235240) (← links)
• Bounded-degree light approximate shortest-path trees in doubling metrics (Q2235274) (← links)
• Parallel construction of multiple independent spanning trees on highly scalable datacenter networks (Q2246461) (← links)
• The minimum routing cost tree problem. State of the art and a core-node based heuristic algorithm (Q2317621) (← links)
• The minimum flow cost Hamiltonian cycle problem: a comparison of formulations (Q2348064) (← links)
• A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem (Q2357170) (← links)
• The zoo of tree spanner problems (Q2476246) (← links)
• A PTAS for the metric case of the optimum weighted source-destination communication spanning tree problem (Q2632008) (← links)
• Hardness and approximation for the star \(p\)-hub routing cost problem in metric graphs (Q2672567) (← links)
• Reload cost trees and network design (Q2913949) (← links)
• Minimax flow tree problems (Q3057112) (← links)
• Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links (Q3639488) (← links)
• Optimization realization of a distance matrix † (Q3864554) (← links)
• Light graphs with small routing cost (Q4537619) (← links)
• Exact algorithms for minimum routing cost trees (Q4537623) (← links)
• Using Petal-Decompositions to Build a Low Stretch Spanning Tree (Q4629391) (← links)
• When Do Gomory--Hu Subtrees Exist? (Q5088606) (← links)
• (Q5091006) (← links)
• (Q5137453) (← links)
• New Valid Inequalities for the Optimal Communication Spanning Tree Problem (Q5138258) (← links)
• Optimization in telecommunication networks (Q5313481) (← links)
• Network design for time‐constrained delivery (Q5503760) (← links)
• Deriving compact extended formulations via LP-based separation techniques (Q5892024) (← links)
• A tight bound on approximating arbitrary metrics by tree metrics (Q5917578) (← links)