Denna tjänst avvecklas 2026-01-19. Läs mer här (länk)

Denna tjänst avvecklas 2026-01-19. Läs mer här (länk)

MINIMUM NUMERICAL TAXONOMY

• INSTANCE: $n\times n$ distance matrix D.

• SOLUTION: Tree metric $d_T$, i.e., an edge weighted tree T of n nodes such that $d_T(i,j)$ is the distance between i and j in T.

• MEASURE: $\max_{i<j}\vert d_T(i,j)-D[i,j]\vert$.

  
  

• Good News: Approximable within 3 [3].

• Bad News: Not approximable within 9/8$-\varepsilon$ for any $\varepsilon >0$ [3].