Approximating hexagonal Steiner minimal trees by fast optimal layout of minimum spanning trees

Guo Hui Lin; Guoliang Xue; Defang Zhou

Approximating hexagonal Steiner minimal trees by fast optimal layout of minimum spanning trees

Guo Hui Lin, Guoliang Xue, Defang Zhou

Research output: Chapter in Book/Report/Conference proceeding › Chapter

Abstract

We study algorithms for approximating a Steiner minimal tree interconnecting n points under hexagonal routing. We prove that (1) every minimum spanning tree is separable; (2) a minimum spanning tree with maximum node degree no more than 5 can be computed in O(n log n) time; (3) an optimal L-shaped layout of a given minimum spanning tree can be computed in O(n) time; (4) an optimal stair-shaped layout of a given minimum spanning tree can be computed in O(n²) time. Computational results on standard benchmarks show that our algorithm compares favorably to the current best algorithms.

Original language	English (US)
Title of host publication	Proceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors
Place of Publication	Piscataway, NJ, United States
Publisher	IEEE
Pages	392-398
Number of pages	7
State	Published - 1999
Externally published	Yes
Event	International Conference on Computer Design (ICCD'99) - Austin, TX, USA Duration: Oct 10 1999 → Oct 13 1999

Other

Other	International Conference on Computer Design (ICCD'99)
City	Austin, TX, USA
Period	10/10/99 → 10/13/99

ASJC Scopus subject areas

Hardware and Architecture
Electrical and Electronic Engineering

Cite this

@inbook{c5100dde1dea4954a80a22b152ba78c9,

title = "Approximating hexagonal Steiner minimal trees by fast optimal layout of minimum spanning trees",

abstract = "We study algorithms for approximating a Steiner minimal tree interconnecting n points under hexagonal routing. We prove that (1) every minimum spanning tree is separable; (2) a minimum spanning tree with maximum node degree no more than 5 can be computed in O(n log n) time; (3) an optimal L-shaped layout of a given minimum spanning tree can be computed in O(n) time; (4) an optimal stair-shaped layout of a given minimum spanning tree can be computed in O(n2) time. Computational results on standard benchmarks show that our algorithm compares favorably to the current best algorithms.",

author = "Lin, {Guo Hui} and Guoliang Xue and Defang Zhou",

year = "1999",

language = "English (US)",

pages = "392--398",

booktitle = "Proceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors",

publisher = "IEEE",

note = "International Conference on Computer Design (ICCD'99) ; Conference date: 10-10-1999 Through 13-10-1999",

}

TY - CHAP

T1 - Approximating hexagonal Steiner minimal trees by fast optimal layout of minimum spanning trees

AU - Lin, Guo Hui

AU - Xue, Guoliang

AU - Zhou, Defang

PY - 1999

Y1 - 1999

N2 - We study algorithms for approximating a Steiner minimal tree interconnecting n points under hexagonal routing. We prove that (1) every minimum spanning tree is separable; (2) a minimum spanning tree with maximum node degree no more than 5 can be computed in O(n log n) time; (3) an optimal L-shaped layout of a given minimum spanning tree can be computed in O(n) time; (4) an optimal stair-shaped layout of a given minimum spanning tree can be computed in O(n2) time. Computational results on standard benchmarks show that our algorithm compares favorably to the current best algorithms.

AB - We study algorithms for approximating a Steiner minimal tree interconnecting n points under hexagonal routing. We prove that (1) every minimum spanning tree is separable; (2) a minimum spanning tree with maximum node degree no more than 5 can be computed in O(n log n) time; (3) an optimal L-shaped layout of a given minimum spanning tree can be computed in O(n) time; (4) an optimal stair-shaped layout of a given minimum spanning tree can be computed in O(n2) time. Computational results on standard benchmarks show that our algorithm compares favorably to the current best algorithms.

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

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

M3 - Chapter

AN - SCOPUS:0033297734

SP - 392

EP - 398

BT - Proceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors

PB - IEEE

CY - Piscataway, NJ, United States

T2 - International Conference on Computer Design (ICCD'99)

Y2 - 10 October 1999 through 13 October 1999

ER -

Approximating hexagonal Steiner minimal trees by fast optimal layout of minimum spanning trees

Abstract

Other

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this