Pages that link to "Item:Q4943844"

The following pages link to A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees (Q4943844):

Displaying 41 items.

• Models and algorithms for network reduction (Q320811) (← links)
• Finding best swap edges minimizing the routing cost of a spanning tree (Q476426) (← links)
• Lagrangean bounds for the optimum communication spanning tree problem (Q611003) (← links)
• On the approximability of the minimum strictly fundamental cycle basis problem (Q629358) (← links)
• Spanning trees: A survey (Q659663) (← links)
• Balancing minimum spanning trees and multiple-source minimum routing cost spanning trees on metric graphs (Q845678) (← links)
• On the intercluster distance of a tree metric (Q861256) (← links)
• On the minimum average distance spanning tree of the hypercube (Q934836) (← links)
• Edge-swapping algorithms for the minimum fundamental cycle basis problem (Q1014301) (← links)
• A linear-time algorithm to compute a MAD tree of an interval graph (Q1029091) (← links)
• Non-approximability of weighted multiple sequence alignment for arbitrary metrics (Q1041795) (← links)
• Non-approximability of weighted multiple sequence alignment. (Q1401267) (← links)
• MAD trees and distance-hereditary graphs (Q1408821) (← links)
• Compact vs. exponential-size LP relaxations (Q1612003) (← links)
• Hardness and approximation of the asynchronous border minimization problem (Q1682885) (← 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)
• Solving the optimum communication spanning tree problem (Q1991267) (← links)
• Bounded-degree light approximate shortest-path trees in doubling metrics (Q2235274) (← links)
• Approximation algorithms for the \(p\)-hub center routing problem in parameterized metric graphs (Q2285135) (← links)
• The minimum routing cost tree problem. State of the art and a core-node based heuristic algorithm (Q2317621) (← links)
• A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem (Q2357170) (← links)
• On the minimum routing cost clustered tree problem (Q2359809) (← links)
• On the uniform edge-partition of a tree (Q2370420) (← links)
• The zoo of tree spanner problems (Q2476246) (← links)
• The swap edges of a multiple-sources routing tree (Q2479532) (← links)
• A survey of the all-pairs shortest paths problem and its variants in graphs (Q2629565) (← links)
• A PTAS for the metric case of the optimum weighted source-destination communication spanning tree problem (Q2632008) (← links)
• On some optimization problems in molecular biology (Q2643356) (← links)
• Hardness and approximation for the star \(p\)-hub routing cost problem in metric graphs (Q2672567) (← links)
• DISTANCE PRESERVING SUBTREES IN MINIMUM AVERAGE DISTANCE SPANNING TREES (Q2864852) (← links)
• Light graphs with small routing cost (Q4537619) (← links)
• Exact algorithms for minimum routing cost trees (Q4537623) (← links)
• New Valid Inequalities for the Optimal Communication Spanning Tree Problem (Q5138258) (← links)
• Optimization in telecommunication networks (Q5313481) (← links)
• Deriving compact extended formulations via LP-based separation techniques (Q5892024) (← links)
• Advances in metric embedding theory (Q5894374) (← links)
• Deriving compact extended formulations via LP-based separation techniques (Q5925168) (← links)
• (Q6124759) (← links)
• (Q6179336) (← links)
• Models of random subtrees of a graph (Q6183888) (← links)