On the intercluster distance of a tree metric

DOI10.1016/J.TCS.2006.07.056zbMATH Open1140.90047OpenAlexW2043721202MaRDI QIDQ861256FDOQ861256

Authors: 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

Recommendations

• A distance metric on binary trees using lattice-theoretic measures
• scientific article; zbMATH DE number 7651097
• The distance Laplacian spectral radius of clique trees
• Wasserstein distance and metric trees
• scientific article; zbMATH DE number 1775400
• The distance energy of clique trees
• A clustering algorithm based on maximal \(\varTheta\)-distant subtrees

zbMATH Keywords

graphapproximation algorithmtree metricoptimization problem

Mathematics Subject Classification ID

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

Cites Work

• Approximation algorithms for the shortest total path length spanning tree problem
• The complexity of the network design problem
• Approximation algorithms for some optimum communication spanning tree problems
• Approximation algorithms for the optimal \(p\)-source communication spanning tree
• Optimum Communication Spanning Trees
• Worst-Case Analysis of Network Design Problem Heuristics
• Exact algorithms for minimum routing cost trees
• A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
• Spanning Trees and Optimization Problems
• A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees
• A polynomial time approximation scheme for the two-source minimum routing cost spanning trees
• A linear-time algorithm to compute a MAD tree of an interval graph
• MAD trees and distance-hereditary graphs
• Title not available (Why is that?)
• The complexity of minimizing certain cost metrics for \(k\)-source spanning trees.
• Average distance in colored graphs

Cited In (3)

• On the minimum routing cost clustered tree problem
• Minimum spanning trees for tree metrics: Abridgements and adjustments
• Inferring metric trees from weighted quartets via an intertaxon distance

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q861256)