On the intercluster distance of a tree metric

DOI10.1016/j.tcs.2006.07.056zbMath1140.90047OpenAlexW2043721202MaRDI QIDQ861256

Bang Ye Wu

Publication date: 9 January 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.07.056

zbMATH Keywords

graphapproximation algorithmoptimization problemtree metric

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation algorithms (68W25)

Related Items (1)

On the minimum routing cost clustered tree problem

Cites Work

• A linear-time algorithm to compute a MAD tree of an interval graph
• The complexity of minimizing certain cost metrics for \(k\)-source spanning trees.
• MAD trees and distance-hereditary graphs
• Approximation algorithms for some optimum communication spanning tree problems
• Approximation algorithms for the shortest total path length spanning tree problem
• Approximation algorithms for the optimal \(p\)-source communication spanning tree
• Average distance in colored graphs
• Optimum Communication Spanning Trees
• Worst-Case Analysis of Network Design Problem Heuristics
• The complexity of the network design problem
• Spanning Trees and Optimization Problems
• A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees
• 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 Minimum Routing Cost Spanning Trees
• Unnamed Item

This page was built for publication: On the intercluster distance of a tree metric