scientific article; zbMATH DE number 1303537
From MaRDI portal
Publication:4250159
Recommendations
- A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
- A polynomial time approximation scheme for the two-source minimum routing cost spanning trees
- Exact algorithms for minimum routing cost trees
- A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees
Cited in
(28)- Approximation algorithms for some optimum communication spanning tree problems
- Approximation algorithms for the shortest total path length spanning tree problem
- On approximating planar metrics by tree metrics.
- Low complexity variants of the arrow distributed directory
- Inventory rebalancing and vehicle routing in bike sharing systems
- The non-approximability of bicriteria network design problems
- Approximating minimum-cost graph problems with spanning tree edges
- The minimum routing cost tree problem. State of the art and a core-node based heuristic algorithm
- On the minimum routing cost clustered tree problem
- A fast algorithm for computing minimum routing cost spanning trees
- Hardness, approximability, and fixed-parameter tractability of the clustered shortest-path tree problem
- scientific article; zbMATH DE number 447202 (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?)
- A polynomial time approximation scheme for the two-source minimum routing cost spanning trees
- A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
- A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem
- Embedding metrics into ultrametrics and graphs into spanning trees with constant average distortion
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Approximation algorithms for the k-source multicast tree construction problem
- Distributed approximation of minimum routing cost trees
- Computational Science and Its Applications – ICCSA 2004
- A tight bound on approximating arbitrary metrics by tree metrics
- Efficient distributed approximation algorithms via probabilistic tree embeddings
- Near optimal multiple alignment within a band in polynomial time
- Balancing minimum spanning trees and multiple-source minimum routing cost spanning trees on metric graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4250159)
