Skip to main content

and
  1. No Access

    Article

    Approximation and Exact Algorithms for Constructing Minimum Ultrametric Trees from Distance Matrices

    An edge-weighted tree is called ultrametric if the distances from the root to all the leaves in the tree are equal. For an n by n distance matrix M, the minimum ultrametric tree for M is an ultrametric tree T ...

    Bang Ye Wu, Kun-Mao Chao, Chuan Yi Tang in Journal of Combinatorial Optimization (1999)