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