Algorithms for routing around a rectangle

A. 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

Fingerprint

Rectangle
Routing
Routing Problem
Linear-time Algorithm
Linear Time
Data Structures
Efficient Algorithms
Routing algorithms
Data structures
Theorem

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Applied Mathematics
  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

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

Algorithms for routing around a rectangle. / Frank, A.; Nishizeki, Takao; Saito, Nobuji; Suzuki, Hitoshi; Tardos, Éva.

In: Discrete Applied Mathematics, Vol. 40, No. 3, 14.12.1992, p. 363-378.

Research output: Contribution to journalArticle

Frank, A, Nishizeki, T, Saito, N, Suzuki, H & Tardos, É 1992, 'Algorithms for routing around a rectangle', Discrete Applied Mathematics, vol. 40, no. 3, pp. 363-378. https://doi.org/10.1016/0166-218X(92)90007-W
Frank, A. ; Nishizeki, Takao ; Saito, Nobuji ; Suzuki, Hitoshi ; Tardos, Éva. / Algorithms for routing around a rectangle. In: Discrete Applied Mathematics. 1992 ; Vol. 40, No. 3. pp. 363-378.
@article{2a1e348a8d614b2ba24557d299bec1d2,
title = "Algorithms for routing around a rectangle",
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.",
author = "A. Frank and Takao Nishizeki and Nobuji Saito and Hitoshi Suzuki and {\'E}va Tardos",
year = "1992",
month = "12",
day = "14",
doi = "10.1016/0166-218X(92)90007-W",
language = "English",
volume = "40",
pages = "363--378",
journal = "Discrete Applied Mathematics",
issn = "0166-218X",
publisher = "Elsevier",
number = "3",

}

TY - JOUR

T1 - Algorithms for routing around a rectangle

AU - Frank, A.

AU - Nishizeki, Takao

AU - Saito, Nobuji

AU - Suzuki, Hitoshi

AU - Tardos, Éva

PY - 1992/12/14

Y1 - 1992/12/14

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0000738251&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0000738251&partnerID=8YFLogxK

U2 - 10.1016/0166-218X(92)90007-W

DO - 10.1016/0166-218X(92)90007-W

M3 - Article

AN - SCOPUS:0000738251

VL - 40

SP - 363

EP - 378

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

IS - 3

ER -