Fast heuristic algorithms for rectilinear steiner trees

This publication has 27 references indexed in Scilit:

• Exact computation of Steiner minimal trees in the plane
  Information Processing Letters, 1986
• Two probabilistic results on rectilinear Steiner trees
  Published by Association for Computing Machinery (ACM) ,1986
• On the History of the Minimum Spanning Tree Problem
  IEEE Annals of the History of Computing, 1985
• An algorithm for the steiner problem in graphs
  Networks, 1984
• STEINER PROBLEMS IN GRAPHS: ALGORITHMS AND APPLICATIONS
  Engineering Optimization, 1983
• Data Structures and Network Algorithms
  Published by Society for Industrial & Applied Mathematics (SIAM) ,1983
• The steiner problem in phylogeny is NP-complete
  Advances in Applied Mathematics, 1982
• The largest minimal rectilinear steiner trees for a set ofn points enclosed in a rectangle with given perimeter
  Networks, 1979
• Rectilinear steiner trees: Efficient special-case algorithms
  Networks, 1977
• Steiner Minimal Trees
  SIAM Journal on Applied Mathematics, 1968