Two probabilistic results on rectilinear steiner trees

This publication has 13 references indexed in Scilit:

• Probabilistic partitioning algorithms for the rectilinear steiner problem
  Networks, 1985
• The largest minimal rectilinear steiner trees for a set ofn points enclosed in a rectangle with given perimeter
  Networks, 1979
• STEINER TREES, STEINER CIRCUITS AND THE INTERFERENCE PROBLEM IN BUILDING DESIGN
  Engineering Optimization, 1979
• An O(n log n) algorithm for suboptimal rectilinear Steiner trees
  IEEE Transactions on Circuits and Systems, 1979
• The Rectilinear Steiner Tree Problem is $NP$-Complete
  SIAM Journal on Applied Mathematics, 1977
• Rectilinear steiner trees: Efficient special-case algorithms
  Networks, 1977
• Use of Steiner's problem in suboptimal routing in rectilinear metric
  IEEE Transactions on Circuits and Systems, 1976
• On Steiner Minimal Trees with Rectilinear Distance
  SIAM Journal on Applied Mathematics, 1976
• Shortest Connection Networks And Some Generalizations
  Bell System Technical Journal, 1957
• On the shortest spanning subtree of a graph and the traveling salesman problem
  Proceedings of the American Mathematical Society, 1956