Skip to main content
SpringerLink
Log in

Fast heuristic algorithms for rectilinear steiner trees

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

A fundamental problem in circuit design is how to connectn points in the plane, to make them electrically common using the least amount of wire. The tree formed, a Steiner tree, is usually constructed with respect to the rectilinear metric. The problem is known to be NP-complete; an extensive review of proposed heuristics is given. An early algorithm by Hanan is shown to have anO(n logn) time implementation using computational geometry techniques. The algorithm can be modified to do sequential searching inO(n 2) total time. However, it is shown that the latter approach runs inO(n 3/2) expected time, forn points selected from anm×m grid. Empirical results are presented for problems up to 10,000 points.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. P. K. Agarwal and M. T. Shing, Algorithms for the Special Cases of Rectilinear Steiner Trees: I. Points on the Boundary of a Rectilinear Rectangle, Technical Report TRCS86-17, University of California at Santa Barbara, 1986.

  2. A. V. Aho, M. R. Garey, and F. K. Hwang, Rectilinear Steiner Trees: Efficient Special-Case Algorithms,Networks,7, 1977, pp. 37–58.

    Article  MATH  MathSciNet  Google Scholar 

  3. J. E. Beasley, An Algorithm for the Steiner Problem in Graphs,Networks,14, 1984, pp. 147–159.

    Article  MATH  MathSciNet  Google Scholar 

  4. M. W. Bern and M. de Carvalho, A Greedy Heuristic for the Rectilinear Steiner Tree Problem, Technical Report, Computer Science Division, University of California at Berkeley, 1985.

  5. M. W. Bern, A More General Special Case of the Steiner Tree Problem, Technical Report, Computer Science Division, University of California at Berkeley, 1986.

  6. M. W. Bern, Two Probabilistic Results on Rectilinear Steiner Trees,Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986, pp. 433–441. (Corrected version available.)

  7. F. R. K. Chung and F. K. Hwang, The Largest Minimal Rectilinear Steiner Trees for a Set ofn Points Enclosed in a Rectangle with Given Perimeter,Networks,9, 1979, pp. 19–36.

    Article  MATH  MathSciNet  Google Scholar 

  8. F. R. K. Chung and R. L. Graham, On Steiner Trees for Bounded Point Sets,Geometriae Dedicata,11, 1981, pp. 353–361.

    Article  MATH  MathSciNet  Google Scholar 

  9. E. J. Cockayne and E. E. Hewgill, Exact Computation on Steiner Minimal Trees in the Plane,Information Processing Letters,22, 1986, pp. 151–156.

    Article  MATH  MathSciNet  Google Scholar 

  10. A. E. Dunlop, personal communication, 1986.

  11. L. R. Foulds and R. L. Graham, The Steiner Problem in Phylogeny is NP-Complete,Advances in Applied Mathematics,3, 1982, pp. 43–49.

    Article  MATH  MathSciNet  Google Scholar 

  12. L. R. Foulds and V. J. Rayward-Smith, Steiner Problems in Graphs: Algorithms and Applications,Engineering Optimization,7, 1983, pp. 7–16.

    Article  Google Scholar 

  13. Y. Fu, Application of Linear Graph Theory to Printed Circuits,Proceedings of the Asilomar Conference on Systems and Circuits, 1967, pp. 721–728.

  14. M. R. Garey and D. S. Johnson,Computers and Intractability, Freeman, San Francisco, 1979.

    MATH  Google Scholar 

  15. E. N. Gilbert, Random Minimal Trees,SIAM Journal,13, 1965, pp. 376–387.

    MATH  Google Scholar 

  16. E. N. Gilbert and H. O. Pollack, Steiner Minimal Trees,SIAM Journal on Applied Mathematics,16, 1968, pp. 1–29.

    Article  MATH  MathSciNet  Google Scholar 

  17. R. L. Graham and P. Hell, On the History of the Minimum Spanning Tree Problem,Annals of the History of Computing,7, 1985, pp. 43–57.

    MATH  MathSciNet  Google Scholar 

  18. M. Hanan, Net Wiring for Large Scale Integrated Circuits, RC 1375, IBM Research Report, 1965.

  19. M. Hanan, On Steiner's Problem with Rectilinear Distance,SIAM Journal on Applied Mathematics,14, 1966, pp. 255–265.

    Article  MATH  MathSciNet  Google Scholar 

  20. M. Hanan, A Counterexample to a Theorem of Fu on Steiner's Problem,IEEE Transactions on Circuit Theory,19, 1972, p. 74.

    Google Scholar 

  21. T. C. Hu and M. T. Shing, A Decomposition Algorithm for Circuit Routing, inVLSI Circuit Layout: Theory and Design, T. C. Hu and E. S. Kuh (eds.), IEEE Press, New York, 1985, pp. 144–152.

    Google Scholar 

  22. F. K. Hwang, On Steiner Minimal Trees with Rectilinear Distance,SIAM Journal on Applied Mathematics,30, 1976, pp. 104–114.

    Article  MATH  MathSciNet  Google Scholar 

  23. F. K. Hwang, The Rectilinear Steiner Problem,Design Automation & Fault Tolerant Computing,3, 1978, pp. 303–310.

    Google Scholar 

  24. F. K. Hwang, AnO(n logn) Algorithm for Suboptimal Rectilinear Steiner Trees,IEEE Transactions on Circuits and Systems,26, 1979, pp. 75–77.

    Article  MATH  Google Scholar 

  25. F. K. Hwang, AnO(n logn) Algorithm for Rectilinear Minimal Spanning Trees,Journal of the ACM,26, 1979, pp. 177–182.

    Article  MATH  Google Scholar 

  26. F. K. Hwang, A Linear Time Algorithm for Full Steiner Trees,Operations Research Letters,4, 1986, pp. 235–237.

    Article  MATH  MathSciNet  Google Scholar 

  27. F. K. Hwang and J. F. Weng, Hexagonal Coordinate Systems and Steiner Minimal Trees,Discrete Mathematics,62, 1986, pp. 49–57.

    Article  MATH  MathSciNet  Google Scholar 

  28. J. Komlos and M. T. Shing, Probabilistic Partitioning Algorithms for the Rectilinear Steiner Problem,Networks,15, 1985, pp. 413–423.

    Article  MATH  MathSciNet  Google Scholar 

  29. L. Kou, G. Markowsky and L. Berman, A Fast Algorithm for Steiner Trees,Acta Informatica,15, 1981, pp. 141–145.

    Article  MATH  MathSciNet  Google Scholar 

  30. J. H. Lee, N. K. Bose, and F. K. Hwang, Use of Steiner's Problem in Suboptimal Routing in Rectilinear Metric,IEEE Transactions on Circuits and Systems,23, 1976, pp. 470–476.

    Article  MATH  MathSciNet  Google Scholar 

  31. A. J. Levin, Algorithm for the Shortest Connection of a Group of Graph Vertices,Soviet Mathematics Doklady,12, 1971, pp. 1477–1481.

    MATH  Google Scholar 

  32. P. W. Purdom and C. A. Brown,The Analysis of Algorithms, Holt, Rinehart and Winston, New York, 1985.

    Google Scholar 

  33. V. J. Rayward-Smith, The Computation of Nearly Minimal Steiner Trees in Graphs,International Journal of Mathematical Education in Science and Technology,14, 1983, pp. 15–23.

    Article  MATH  MathSciNet  Google Scholar 

  34. V. J. Rayward-Smith and A. Clare, On Finding Steiner Vertices,Networks,16, 1986, pp. 283–294.

    Article  MATH  MathSciNet  Google Scholar 

  35. M. Servit, Heuristic Algorithms for Rectilinear Steiner Trees,Digital Processes,7, 1981, pp. 21–32.

    MATH  Google Scholar 

  36. M. L. Shore, L. R. Foulds, and P. B. Gibbons, An Algorithm for the Steiner Problem in Graphs,Networks,12, 1982, pp. 323–333.

    Article  MATH  MathSciNet  Google Scholar 

  37. J. M. Smith and J. S. Liebman, Steiner Trees, Steiner Circuits and the Interference Problem in Building Design,Engineering Optimization,4, 1979, pp. 15–36.

    Article  Google Scholar 

  38. J. M. Smith, D. T. Lee, and J. S. Liebman, AnO(N logN) Heuristic Algorithm for the Rectilinear Steiner Minimal Tree Problem,Engineering Optimization,4, 1980, pp. 179–192.

    Article  Google Scholar 

  39. H. Takahashi and A. Matsuyama, An Approximate Solution for the Steiner Problem in Graphs,Mathematica Japonica,24, 1980, pp. 573–577.

    MATH  MathSciNet  Google Scholar 

  40. R. E. Tarjan,Data Structures and Network Algorithms, SIAM, Philadelphia, PA, 1983.

    Google Scholar 

  41. J. A. Wald and C. J. Colbourn, Steiner Trees in Outerplanar Graphs,Proceedings of the 13th S.E. Conference on Combinatorics, Graph Theory, and Computing, 1982, pp. 15–22.

  42. T. Whitney and C. Mead, An Integer-Based Hierarchical Representation for VLSI, inAdvanced Research in VLSI, C. E. Leiserson (ed.), MIT Press, Cambridge, MA, 1986, pp. 241–257.

    Google Scholar 

  43. Y. F. Wu, P. Widmayer, and C. K. Wong, A Faster Approximation Algorithm for the Steiner Problem in Graphs,Acta Informatica,23, 1986, pp. 223–229.

    Article  MATH  MathSciNet  Google Scholar 

  44. Y. Y. Yang and O. Wing, Optimal and Suboptimal Solution Algorithms for the Wiring Problem,Proceedings of the International Symposium on Circuit Theory, 1972, pp. 154–158.

  45. Y. Y. Yang and O. Wing, Suboptimal Algorithm for a Wire Routing Problem,IEEE Transactions on Circuit Theory,19, 1972, pp. 508–510.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Virginia, Thornton Hall, 22903, Charlottesville, VA, USA

    Dana Richards

Authors
  1. Dana Richards
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by C. L. Liu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Richards, D. Fast heuristic algorithms for rectilinear steiner trees. Algorithmica 4, 191–207 (1989). https://doi.org/10.1007/BF01553886

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01553886

Key words

Search

Navigation