Pages that link to "Item:Q1887037"

The following pages link to Approximation algorithms for the optimal \(p\)-source communication spanning tree (Q1887037):

Displaying 18 items.

• Models and algorithms for network reduction (Q320811) (← links)
• Tight bounds from a path based formulation for the tree of hub location problem (Q833527) (← links)
• On the intercluster distance of a tree metric (Q861256) (← links)
• A minimax assignment problem in treelike communication networks (Q1390338) (← links)
• The complexity of minimizing certain cost metrics for \(k\)-source spanning trees. (Q1408818) (← links)
• Approximation algorithms for some optimum communication spanning tree problems (Q1566575) (← links)
• Combined column-and-row-generation for the optimal communication spanning tree problem (Q1652585) (← 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)
• A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem (Q2357170) (← links)
• The swap edges of a multiple-sources routing tree (Q2479532) (← links)
• A PTAS for the metric case of the optimum weighted source-destination communication spanning tree problem (Q2632008) (← links)
• (Q4430838) (← links)
• On Optimal Solutions for the Optimal Communication Spanning Tree Problem (Q5189006) (← links)
• Approximation algorithms for somek-source shortest paths spanning tree problems (Q5471085) (← links)
• Approximation algorithms for the k-source multicast tree construction problem (Q5471088) (← links)
• Minimum-Weight Spanning Tree Construction in <i>O</i>(log log <i>n</i>) Communication Rounds (Q5700572) (← links)
• Computational Science and Its Applications – ICCSA 2004 (Q5901295) (← links)