Skip to main content
SpringerLink
Log in

A fast algorithm for computing optimal rectilinear Steiner trees for extremal point sets

Extended abstract

  • Session 9
  • Conference paper
  • First Online:
Algorithms and Computations (ISAAC 1995)

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

Included in the following conference series:

Abstract

We present a fast algorithm to compute an optimal rectilinear Steiner tree for extremal point sets. A point set is extremal if each point lies on the boundary of a rectilinear convex hull of the point set. Our algorithm can be used in homotopic routing in VLSI layout design and it runs in O(k 2n) time, where n is the size of the point set and k is the size of its rectilinear convex hull.

This work is supported in part by the RGC CERG grant HKUST 190/93E.

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.

References

  1. M. Bern, Faster Exact Algorithms for Steiner Tree in Planar Networks, Networks, 7 (1990), pp. 109–120.

    Google Scholar 

  2. S.W. Cheng, A. Lim, and C. Wu, Optimal Rectilinear Steiner Tree for Extremal Point Sets, in Proc. Int'l Symp. Alg. and Comput. (ISAAC), 1993, LNCS 762, pp. 523–532.

    Google Scholar 

  3. S.W. Cheng and C.K. Tang, A Fast Algorithm for Computing Optimal Rectilinear Steiner Trees for Extremal Point Sets, Technical Report HKUST-CS95-20, Department of Computer Science, HKUST.

    Google Scholar 

  4. R. E. Erickson, C. Monma, and A. F. Veinott, Send-and-split Method for Minimum-cost Network Flows, Mathematical Operation Research, 12 (1987), pp. 634–664.

    Google Scholar 

  5. M. Kaufmann, S. Gao, and K. Thulasiraman, On Steiner Minimal Trees in Grid Graphs and Its Application to VLSI Routing, in Proc. Int'l Symp. Alg. and Comput. (ISAAC), 1994, LNCS 834, pp. 351–359.

    Google Scholar 

  6. C.E. Leiserson and F.M. Maley, Algorithms for Routing and Testing Routability of Planar VLSI Layouts, Proc. 7th Ann. Symp. Theory of Comput., 1985, pp. 69–78.

    Google Scholar 

  7. J. Provan, Convexity and the Steiner Tree Problem, Networks, 18 (1988), pp. 55–72.

    Google Scholar 

  8. D. Richards and J. Salowe, A Linear-Time Algorithm to Construct a Rectilinear Steiner Minimal Tree for k-Extremal Point Sets, Algorithmica, 7 (1992), pp. 247–276.

    Google Scholar 

  9. J.D. Ullamn, Computational Aspects of VLSI, Computer Science Press, 1984.

    Google Scholar 

  10. Y. Y. Yang and O. Wing. Optimal and Suboptimal Solution Algorithms for the Wiring Problem. Proc. IEEE Int'l Symp. Circuit Theory, pp. 154–158, 1972.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong

    Siu-Wing Cheng & Chi-Keung Tang

Authors
  1. Siu-Wing Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chi-Keung Tang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

John Staples Peter Eades Naoki Katoh Alistair Moffat

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cheng, SW., Tang, CK. (1995). A fast algorithm for computing optimal rectilinear Steiner trees for extremal point sets. In: Staples, J., Eades, P., Katoh, N., Moffat, A. (eds) Algorithms and Computations. ISAAC 1995. Lecture Notes in Computer Science, vol 1004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015438

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60573-7

  • Online ISBN: 978-3-540-47766-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation