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 proceedingChapter

7 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors
Place of PublicationPiscataway, NJ, United States
PublisherIEEE
Pages392-398
Number of pages7
StatePublished - 1999
Externally publishedYes
EventInternational Conference on Computer Design (ICCD'99) - Austin, TX, USA
Duration: Oct 10 1999Oct 13 1999

Other

OtherInternational Conference on Computer Design (ICCD'99)
CityAustin, TX, USA
Period10/10/9910/13/99

ASJC Scopus subject areas

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Approximating hexagonal Steiner minimal trees by fast optimal layout of minimum spanning trees'. Together they form a unique fingerprint.

  • Cite this

    Lin, G. H., Xue, G., & Zhou, D. (1999). Approximating hexagonal Steiner minimal trees by fast optimal layout of minimum spanning trees. In Proceedings - IEEE International Conference on Computer Design: VLSI in Computers and Processors (pp. 392-398). IEEE.