Generalized river routing — Algorithms and performance bounds

Extended abstract
  • Jean R. S. Blair
  • Errol L. Lloyd
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 227)


Traditional restrictions on river routing confine the connecting wires to the channel between the terminal rows. In [3] these restrictions were somewhat relaxed, thereby permitting a limited type of routing outside of the channel. In this paper we consider a further relaxation of the traditional constraints and consider a new class of “generalized” river routings. We show that this new class contains routings that are significantly more compact than those previously considered. In addition, we give a fast polynomial time algorithm for producing optimal routings in this new class. The running time of this algorithm is the best possible and is identical to the time required to produce optimal river routings under the traditional model.


Channel Width Optimal Routing Minimum Separation Separation Algorithm Greedy Fashion 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    P. B. Arnold, “Complexity for single row routing,” Technical Report TR-22-82, Center for Research in Computing Technology, Harvard University (1982).Google Scholar
  2. 2.
    D. Dolev, K. Karplus, A. Siegel, A. Strong, J. D. Ullman, “Optimal wiring between rectangles,” Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computing, pp.312–317 (1981).Google Scholar
  3. 3.
    E. L. Lloyd S. S. Ravi, “One-layer routing without component constraints,” Journal of Computer and System Sciences 28(3), pp.420–438 (June 1984).Google Scholar
  4. 4.
    R. Y. Pinter, “Optimal routing in rectilinear channels,” pp. 160–177 in VLSI Systems and Computations, ed. H. T. Kung et al., Computer Science Press, Rockville, Md. (1981).Google Scholar
  5. 5.
    R. Raghavan S. Sahni, “Single row routing,” IEEE Transactions on Computers c-32(3), pp.209–220 (March 1983).Google Scholar
  6. 6.
    A. L. Rosenberg, “Three-dimensional VLSI: A case study,” Journal of the Association for Computing Machinery 30(3), pp.397–416 (July 1983).Google Scholar
  7. 7.
    A. Siegel D. Dolev, “The separation for general single-layer wiring barriers,” pp. 143–152 in VLSI Systems and Computations, ed. H. T. Kung et al., Computer Science Press, Rochville, Md. (1981).Google Scholar
  8. 8.
    M. Tompa, “An optimal solution to a wire-routing problem,” Proceedings of the Twelfth Annual ACM Symposium on Theory of Computing, pp.161–176 (May 1980).Google Scholar
  9. 9.
    S. Tsukiyama, E. S. Kuh, I. Shirakawa, “An algorithm for single-row routing with prescribed street congestions,” IEEE Transactions on Circuits and Systems CAS-27(9), pp.765–771 (1980).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Jean R. S. Blair
    • 1
  • Errol L. Lloyd
    • 1
  1. 1.Department of Computer ScienceUniversity of PittsburghPittsburgh

Personalised recommendations