Skip to main content
SpringerLink
Log in

Some new results on a restricted channel routing problem

  • Conference paper
  • First Online:
VLSI Algorithms and Architectures (AWOC 1986)

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

Included in the following conference series:

  • 153 Accesses

Abstract

In the Manhattan model, a two-terminal channel routing subproblem is considered, where the run length is at most two and for each net, its exit terminal is to the right of its entry terminal. For this problem, a lower bound of d+3 tracks, where d is the density, is derived and a polynomial optimal algorithm is given.

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. Hashimoto A. and Stevens J. "Wire Routing by Optimizing Channel Assignment within Large Apertures", Proc. 8-th Design Automation Workshop, IEEE (1971), 214–224.

    Google Scholar 

  2. Hightower D. "The Interconnection Problem: A Tutorial", Computer 7, 4 (April 1974), 18–32.

    Google Scholar 

  3. Deutsch D. N. "A ‘Dogleg’ Channel Router", Proc. 19-th Design Automation Conference, IEEE (1976), 425–433.

    Google Scholar 

  4. Preparata, F. P. and Lipsky W. "Optimal Three-Layer Channel Routing", IEEE Transections on Computers, 33, 5 (May 1984), 427–437.

    Google Scholar 

  5. Kawamoto T. and Kajitani Y. "The Minimum Width Routing of a 2-Row 2-Layer Polycell-Layout", Proc. 16-th Design Automation Conference, IEEE (1979), 290–296.

    Google Scholar 

  6. Szymanski T. "Dogleg Channel Routing is NP-complete", to appear.

    Google Scholar 

  7. Rivest R. L., Baratz A. E. and Miller G. "Provably Good Channel Routing Algorithms", Proc. CMU Conference on VLSI Systems and Computations, (1981), 153–159.

    Google Scholar 

  8. Baker B. S., S. N. Bhatt and T. Leighton "An Approximation Algorithm for Manhattan Routing", Advances in Computing Research, 2, (1984), 205–229.

    Google Scholar 

  9. Brown D. and Rivest R. L. "New Lower Bounds on Channel Width", Proc. CMU Conference on VLSI Systems and Computations, (Computer Science Press 1981), 178–185.

    Google Scholar 

  10. Yoshimura T. and Kuh E. "Efficient Algorithms for Channel Routing", IEEE Transections on Computer, CAD-1, 1 (January 1982), 25–35.

    Google Scholar 

  11. Lodi E. and Preparata F. P. "A Heuristic for Manahattan Routing" to appear.

    Google Scholar 

  12. Kerninghan B. W., Schweickert D. G., Persky G. "An Optimum Channel-Routing Algorithm for Polycell Layouts of Integrated Circuits", Proc. 11-th DA Workshop, 1973, 26–46.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica di Pisa, Italy

    E. Lodi & L. Pagli

Authors
  1. E. Lodi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. L. Pagli
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Filia Makedon Kurt Mehlhorn T. Papatheodorou P. Spirakis

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lodi, E., Pagli, L. (1986). Some new results on a restricted channel routing problem. In: Makedon, F., Mehlhorn, K., Papatheodorou, T., Spirakis, P. (eds) VLSI Algorithms and Architectures. AWOC 1986. Lecture Notes in Computer Science, vol 227. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16766-8_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-16766-8_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16766-2

  • Online ISBN: 978-3-540-38746-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation