A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1303537
- On the minimum routing cost clustered tree problem
- Exact algorithms for minimum routing cost trees
- A polynomial time approximation scheme for the two-source minimum routing cost spanning trees
- A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees
Cited in
(52)- Approximating minimum-cost graph problems with spanning tree edges
- The zoo of tree spanner problems
- MAD trees and distance-hereditary graphs
- An initial study of budgeted Steiner networks
- The swap edges of a multiple-sources routing tree
- Geometric spanning trees minimizing the Wiener index
- NeuroPrim: an attention-based model for solving NP-hard spanning tree problems
- Edge-swapping algorithms for the minimum fundamental cycle basis problem
- A survey of the all-pairs shortest paths problem and its variants in graphs
- On the approximability of the minimum strictly fundamental cycle basis problem
- scientific article; zbMATH DE number 447202 (Why is no real title available?)
- On some optimization problems in molecular biology
- Balancing minimum spanning trees and multiple-source minimum routing cost spanning trees on metric graphs
- Solving the optimum communication spanning tree problem
- Spanning trees: A survey
- Bounded-degree light approximate shortest-path trees in doubling metrics
- New valid inequalities for the optimal communication spanning tree problem
- On the minimum routing cost clustered tree problem
- Non-approximability of weighted multiple sequence alignment for arbitrary metrics
- A polynomial time approximation scheme for the two-source minimum routing cost spanning trees
- An improved algorithm for the k-source maximum eccentricity spanning trees
- Exact algorithms for minimum routing cost trees
- A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem
- A PTAS for the metric case of the optimum weighted source-destination communication spanning tree problem
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Models and algorithms for network reduction
- Advances in metric embedding theory
- Computational Science and Its Applications – ICCSA 2004
- Approximation algorithms for the shortest total path length spanning tree problem
- Finding best swap edges minimizing the routing cost of a spanning tree
- Models of random subtrees of a graph
- Deriving compact extended formulations via LP-based separation techniques
- Lagrangean bounds for the optimum communication spanning tree problem
- scientific article; zbMATH DE number 2086374 (Why is no real title available?)
- Hardness and approximation for the star \(p\)-hub routing cost problem in metric graphs
- Distributed approximation of minimum routing cost trees
- Hardness and approximation of the asynchronous border minimization problem
- Distance preserving subtrees in minimum average distance spanning trees
- Non-approximability of weighted multiple sequence alignment.
- Optimization in telecommunication networks
- On the intercluster distance of a tree metric
- Approximation algorithms for the \(p\)-hub center routing problem in parameterized metric graphs
- Compact vs. exponential-size LP relaxations
- Approximation algorithms for the optimal \(p\)-source communication spanning tree
- On the uniform edge-partition of a tree
- Light graphs with small routing cost
- Deriving compact extended formulations via LP-based separation techniques
- A linear-time algorithm to compute a MAD tree of an interval graph
- On the minimum average distance spanning tree of the hypercube
- The minimum routing cost tree problem. State of the art and a core-node based heuristic algorithm
- Geometric spanning trees minimizing the Wiener index
- A fast algorithm for computing minimum routing cost spanning trees
This page was built for publication: A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4943844)
