Skip to main content
SpringerLink
Log in

Correct and provably efficient methods for rectilinear Steiner spanning tree generation

  • Track 9: VLSI Design
  • Conference paper
  • First Online:
Book cover Computing in the 90's (Great Lakes CS 1989)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 507))

Included in the following conference series:

  • 108 Accesses

Abstract

Two rectilinear Steiner spanning tree algorithms are presented, proven to be correct, and examined with regard to their complexity. It is shown that their worst case efficiencies are merely 1.5 times the optimum solution. These algorithms, when experimentally compared to existing algorithms, excel. They in fact produce the best solutions over 80% of the time and are never more than 1% from the best solution found.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6. References

  1. Bern, M. W., and M. de Carvalho. “A Greedy Hueristic for the Rectilinear Steiner Tree Problem.” Univ. California at Berkeley TR, (1985).

    Google Scholar 

  2. Garey, M. R., and D. S. Johnson. “The Rectilinear Steiner Tree Problem is NP-Complete.” SIAM J of Applied Mathematics, 32 (1977), 855–859.

    Google Scholar 

  3. Hanan, M. “On Steiners Problem with Rectilinear Distance.” SIAM Journal of Applied Mathematics, 14:2 (1966), 255–265.

    Article  MATH  MathSciNet  Google Scholar 

  4. Ho, J., G. Vijayan, and C. K. Wong. “A New Approach to the Steiner Tree Problem.” Proc. 26th ACM/IEEE Design Auto. Conf. (1989), 161–166.

    Google Scholar 

  5. Hwang, F. K. “On Steiner Minimal Trees with Rectilinear Distance.” SIAM Journal of Applied Mathematics, 30 (1976), 104–114.

    Article  MATH  Google Scholar 

  6. Hwang, F. K. “An O(nlogn) Algorithm for Sub-optimal Rectilinear Steiner Trees.” IEEE Trans. on Circuits and Systems CAS-26:1 (1979), 75–77.

    Article  Google Scholar 

  7. Imai, H., and T. Asano. “Efficient Algorithms for Geometric Graph Search Problems.” SIAM Journal of Computing, 15:2 (1986), 478–494.

    Article  MATH  MathSciNet  Google Scholar 

  8. Komlos, J., and M. T. Shing. “Probabilistic Partitioning Algorithms for the Rectilinear Steiner Problem.” Network, 15 (1985), 413–423.

    MATH  MathSciNet  Google Scholar 

  9. Kruskal, J. B. “On the Shortest Spanning Subtree of a Graph.” Proceedings of the American Mathematical Society, 7 (1956) 48–50.

    Article  MATH  MathSciNet  Google Scholar 

  10. Larson, R. C., and V. O. Li. “Finding Minimum Rectilinear Distance Paths in the Presence of Barriers.” Networks, 11 (1981), 285–304.

    MATH  MathSciNet  Google Scholar 

  11. Lee, J. H., N. K. Bose, and F. K. Hwang. “Use of Steiner's Problem in Suboptimal Routing in Rectilinear Metric.” IEEE Trans. on Circuits and Systems, CAS-23:7 (July 1976), 470–476.

    Article  MathSciNet  Google Scholar 

  12. Li, J. T., and M. Marek-Sadowska. “Global Routing for Gate Arrays.” IEEE Trans. on Computer Aided Design of Integrated Circuits and Systems, CAD-3:4 (Oct 1984), 298–308.

    Google Scholar 

  13. Ng, A. P-C, P. Raghavan, and C. D. Thompson. “Experimental Results for a Linear Program Global Router.” manuscript submitted to: Computers and AI and 1986 ACM Design Automation Conference, (November 1985).

    Google Scholar 

  14. Prim, R. C. “Shortest Connection Networks and Some Generalizations.” Bell System Tech. J. 36 (1957), 1389–1401.

    Google Scholar 

  15. Rayward-Smith, V.J. “The Computation of Nearly Minimal Steiner Trees in Graphs.” Int. J. of Math. Education in Sci. and Tech. 14 (1983), 15–23.

    MATH  MathSciNet  Google Scholar 

  16. Richards, D. “Fast Heuristic Algorithms for Rectilinear Steiner Trees.” Algorithmica 4 (1989), 191–207.

    Article  MATH  MathSciNet  Google Scholar 

  17. Smith, J. M., D. T. Lee, and J. S. Liebman. “An O(nlogn) Heuristic Algorithm for the Rectilinear Steiner Minimal Tree Problem.” Eng. Optimization 4 (1980), 179–192.

    Google Scholar 

  18. Takahashi, H. and A Matsuyama. “An Approximate Solution for the Steiner Problem in Graphs.” Mathematica Japonica 24 (1980), 573–577.

    MATH  MathSciNet  Google Scholar 

  19. Van Cleave, N. “Rectilinear Steiner Tree Algorithms for the Global Routing Phase of VLSI Design.” M.S. Thesis, University of Kentucky, Lexington, KY (1987).

    Google Scholar 

  20. Vecchi, M., and S. Kirkpatrick. “Global Wiring by Simulated Annealing.” IEEE Trans. on Computer-Aided Design,” CAD-2:4 (Oct 1983), 215–222.

    Article  Google Scholar 

  21. Winter, P. “Steiner Problem in Networks: A Survey.” Networks, 17 (1987), 128–167.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Kentucky, USA

    F. D. Lewis & N. Van Cleave

Authors
  1. F. D. Lewis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. N. Van Cleave
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Naveed A. Sherwani Elise de Doncker John A. Kapenga

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lewis, F.D., Van Cleave, N. (1991). Correct and provably efficient methods for rectilinear Steiner spanning tree generation. In: Sherwani, N.A., de Doncker, E., Kapenga, J.A. (eds) Computing in the 90's. Great Lakes CS 1989. Lecture Notes in Computer Science, vol 507. Springer, New York, NY. https://doi.org/10.1007/BFb0038511

Download citation

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

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-97628-0

  • Online ISBN: 978-0-387-34815-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation