A fast and simple Steiner routing heuristic

Manjit Borah, Robert Michael Owens, Mary Jane Irwin

Research output: Contribution to journalArticle

17 Citations (Scopus)

Abstract

This paper presents a simple yet efficient heuristic for rectilinear Steiner routing. The basic heuristic introduces a new edge into the existing tree for another, costlier edge such that the resulting graph remains a tree. The simplicity of the heuristic led to an O(n2) implementation using basic data structures. Asymptotic time requirement of the heuristic can be further improved to O(n log n) using sophisticated data structures. Due to the generality of the heuristic different cost criteria can be applied to produce routes with different properties. The heuristic has been successfully applied to the problem of minimum-length Steiner routing and minimizing critical-sink Elmore delay.

Original languageEnglish (US)
Pages (from-to)51-67
Number of pages17
JournalDiscrete Applied Mathematics
Volume90
Issue number1-3
DOIs
StatePublished - Jan 15 1999

Fingerprint

Data structures
Routing
Heuristics
Data Structures
Costs
Simplicity
Requirements
Graph in graph theory

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Cite this

Borah, Manjit ; Owens, Robert Michael ; Irwin, Mary Jane. / A fast and simple Steiner routing heuristic. In: Discrete Applied Mathematics. 1999 ; Vol. 90, No. 1-3. pp. 51-67.
@article{06468e8e086748458dcdb9aeacda5808,
title = "A fast and simple Steiner routing heuristic",
abstract = "This paper presents a simple yet efficient heuristic for rectilinear Steiner routing. The basic heuristic introduces a new edge into the existing tree for another, costlier edge such that the resulting graph remains a tree. The simplicity of the heuristic led to an O(n2) implementation using basic data structures. Asymptotic time requirement of the heuristic can be further improved to O(n log n) using sophisticated data structures. Due to the generality of the heuristic different cost criteria can be applied to produce routes with different properties. The heuristic has been successfully applied to the problem of minimum-length Steiner routing and minimizing critical-sink Elmore delay.",
author = "Manjit Borah and Owens, {Robert Michael} and Irwin, {Mary Jane}",
year = "1999",
month = "1",
day = "15",
doi = "10.1016/S0166-218X(98)00085-7",
language = "English (US)",
volume = "90",
pages = "51--67",
journal = "Discrete Applied Mathematics",
issn = "0166-218X",
publisher = "Elsevier",
number = "1-3",

}

A fast and simple Steiner routing heuristic. / Borah, Manjit; Owens, Robert Michael; Irwin, Mary Jane.

In: Discrete Applied Mathematics, Vol. 90, No. 1-3, 15.01.1999, p. 51-67.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A fast and simple Steiner routing heuristic

AU - Borah, Manjit

AU - Owens, Robert Michael

AU - Irwin, Mary Jane

PY - 1999/1/15

Y1 - 1999/1/15

N2 - This paper presents a simple yet efficient heuristic for rectilinear Steiner routing. The basic heuristic introduces a new edge into the existing tree for another, costlier edge such that the resulting graph remains a tree. The simplicity of the heuristic led to an O(n2) implementation using basic data structures. Asymptotic time requirement of the heuristic can be further improved to O(n log n) using sophisticated data structures. Due to the generality of the heuristic different cost criteria can be applied to produce routes with different properties. The heuristic has been successfully applied to the problem of minimum-length Steiner routing and minimizing critical-sink Elmore delay.

AB - This paper presents a simple yet efficient heuristic for rectilinear Steiner routing. The basic heuristic introduces a new edge into the existing tree for another, costlier edge such that the resulting graph remains a tree. The simplicity of the heuristic led to an O(n2) implementation using basic data structures. Asymptotic time requirement of the heuristic can be further improved to O(n log n) using sophisticated data structures. Due to the generality of the heuristic different cost criteria can be applied to produce routes with different properties. The heuristic has been successfully applied to the problem of minimum-length Steiner routing and minimizing critical-sink Elmore delay.

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

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

U2 - 10.1016/S0166-218X(98)00085-7

DO - 10.1016/S0166-218X(98)00085-7

M3 - Article

AN - SCOPUS:0001885235

VL - 90

SP - 51

EP - 67

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

IS - 1-3

ER -