Mathematical Programming

, Volume 9, Issue 1, pp 240–246

Locating the vertices of a steiner tree in an arbitrary metric space

  • David Sankoff
  • Pascale Rousseau

DOI: 10.1007/BF01681346

Cite this article as:
Sankoff, D. & Rousseau, P. Mathematical Programming (1975) 9: 240. doi:10.1007/BF01681346


Given a tree each of whose terminal vertices is associated with a given point in a compact metric space, the problem is to optimally associate a point in this space to each nonterminal vertex of the tree. The optimality criterion is the minimization of the sum of the lengths, in the metric space, over all edges of the tree. This note shows how a dynamic programming solution to this problem generalizes a number of previously published algorithms in diverse metric spaces, each of which has direct and significant applications to biological systematics or evolutionary theory.

Copyright information

© The Mathematical Programming Society 1975

Authors and Affiliations

  • David Sankoff
    • 1
  • Pascale Rousseau
    • 1
  1. 1.Université de MontréalMontréalCanada

Personalised recommendations