Skip to main content
SpringerLink
Log in

Channel routing in knock-knee mode: Simplified algorithms and proofs

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

We give unified and simplified algorithms and proofs for three results on channel routing in knock-knee mode. LetP be a channel routing problem with densityd max.

  1. (a)

    [Rivest/Baratz/Miller, Preparata/Lipski]. If all nets inP are two-terminal nets thend max tracks suffice.

  2. (b)

    [Preparata/Sarrafzadeh]. If all nets inP are two- or three-terminal nets then [3d max/2] tracks suffice.

  3. (c)

    [Sarrafzadeh/Preparata]. 2d max-1 tracks always suffice.

In all three cases a solution can be found in linear time; this is an improvement in case (b).

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.

Similar content being viewed by others

References

  1. M. Becker and K. Mehlhorn.Routing in planar networks. Technical Report, FB 10, Universität des Saarlandes, Sept. 1984.

  2. A. Frank.Disjoint paths in a rectilinear grid. Combinatorica,2, 4 (1982), 361–371.

    Article  MATH  MathSciNet  Google Scholar 

  3. M. Kaufmann and K. Mehlhorn.Generalized switchbox routing. Proc. ICALP 1985, Nafplion, Greece. Springer-Verlag, New York, 1985, pp. 328–337.

    Google Scholar 

  4. K. Mehlhorn and F. P. Preparata.Routing through a rectangle. J. ACM,33, 1 (1986), 60–85.

    Article  MathSciNet  Google Scholar 

  5. H. Okamura and P. D. Seymour.Multicommodity flows in planar graphs. J. Combin. Theory,B31 (1981), 75–81.

    MathSciNet  Google Scholar 

  6. R. L. Rivest, A. E. Baratz, and G. Miller.Provably good channel routing algorithms, Proceedings CMU Conference on VLSI Systems and Computations, Oct. 1981, pp. 151–159.

  7. F. P. Preparata and W. Lipski, Jr.,Optimal three-layer channel routing. IEEE Trans. Comput.,C-33, 5 (1984), 427–437.

    Article  Google Scholar 

  8. F. P. Preparata and M. Sarrafzadeh.Channel routing of nets of bounded degree, Proc. VLSI: Algorithms and Architectures. Amain, Italy, North-Holland, Amsterdam, 1984, pp. 189–203.

    Google Scholar 

  9. M. Sarrafzadeh and F. P. Preparata.Compact channel routing of multiterminal nets. Ann. Discrete Math.,25 (1985), 255–280.

    MathSciNet  Google Scholar 

  10. S. D. Gao.An algorithm for two-layer channel routing. Proc. of STACS 1985, LNCS Vol. 182, pp. 151–160.

Download references

Author information

Authors and Affiliations

  1. FB 10, Informatik, Universität des Saarlandes, 6600, Saarbrücken, West Germany

    Kurt Mehlhorn

  2. Coordinated Science Laboratory, University of Illinois, 61801, Urbana, Illinois, USA

    F. P. Preparata & M. Sarrafzadeh

Authors
  1. Kurt Mehlhorn
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. F. P. Preparata
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. Sarrafzadeh
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by C. K. Wong.

This research was supported by the DFG under grant SFB 124, TPB2, VLSI Entwurf und Parallelität.

This research was supported by the Semiconductor Research Corporation under Contract RSCH 94-06-049-6.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mehlhorn, K., Preparata, F.P. & Sarrafzadeh, M. Channel routing in knock-knee mode: Simplified algorithms and proofs. Algorithmica 1, 213–221 (1986). https://doi.org/10.1007/BF01840443

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation