Algorithms for routing around a rectangle

András Frank, Takao Nishizeki, Nobuji Saito, Hitoshi Suzuki, Éva Tardos

Research output: Contribution to journalArticle

45 Citations (Scopus)

Abstract

Simple efficient algorithms are given for three routing problems around a rectangle. The algorithms find routing in two or three layers for two-terminal nets specified on the sides of a rectangle. All algorithms run in linear time. One of the three routing problems is the minimum area routing previously considered by LaPaugh and Gonzalez and Lee. The algorithms they developed run in time O(n3) and O(n) respectively. Our simple linear time algorithm is based on a theorem of Okamura and Seymour and on a data structure developed by Suzuki, Ishiguro and Nishizeki.

Original languageEnglish
Pages (from-to)363-378
Number of pages16
JournalDiscrete Applied Mathematics
Volume40
Issue number3
DOIs
Publication statusPublished - Dec 14 1992

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Algorithms for routing around a rectangle'. Together they form a unique fingerprint.

  • Cite this

    Frank, A., Nishizeki, T., Saito, N., Suzuki, H., & Tardos, É. (1992). Algorithms for routing around a rectangle. Discrete Applied Mathematics, 40(3), 363-378. https://doi.org/10.1016/0166-218X(92)90007-W