The Algorithm Design Manual
About the Book
Programming Challenges

The Stony Brook Algorithm Repository

Steven Skiena
Stony Brook University
Dept. of Computer Science

Salowe's Rectilinear Steiner trees

Salowe and Warme developed a program for computing exact rectilinear Steiner minimal trees, which should be capable of handling up to 30 points routinely. It is available by anonymous ftp from in pub/french/salowe/newsteiner.tar.Z. The program is described in the paper "Thirty-Five-Point Rectilinear Steiner Minimal Trees in a Day", in Networks: An International Journal, volume 25, 1995.

Also available is another Steiner tree program from Virgina, by Gabriel Robins and Tong-Tong Zhang. This one produces a good heuristic solution.

  • Download Files (local site)
  • Copy of Tech. Paper

    Problem Links

    Steiner Tree (5)

    This page last modified on 2008-07-10 .