Balancing Steiner minimum trees and shortest-path trees in the rectilinear plane

Guo Hui Lin, Guoliang Xue

Research output: Chapter in Book/Report/Conference proceedingChapter

4 Scopus citations

Abstract

We consider the problem of balancing shortest-path trees and Steiner minimum trees in the rectilinear plane. This problem has applications in telecommunication, wire routing and VLSI physical design. We present a polynomial time approximation algorithm which simultaneously approximates both the shortest-path tree and the Steiner minimum tree. Previous results guarantee a balanced approximation ratio of about 2.4142. Our algorithm improves the value to 2.0806.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE International Symposium on Circuits and Systems
Volume6
StatePublished - 1999
Externally publishedYes
EventProceedings of the 1999 IEEE International Symposium on Circuits and Systems, ISCAS '99 - Orlando, FL, USA
Duration: May 30 1999Jun 2 1999

Other

OtherProceedings of the 1999 IEEE International Symposium on Circuits and Systems, ISCAS '99
CityOrlando, FL, USA
Period5/30/996/2/99

ASJC Scopus subject areas

  • Electronic, Optical and Magnetic Materials
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Balancing Steiner minimum trees and shortest-path trees in the rectilinear plane'. Together they form a unique fingerprint.

  • Cite this

    Lin, G. H., & Xue, G. (1999). Balancing Steiner minimum trees and shortest-path trees in the rectilinear plane. In Proceedings - IEEE International Symposium on Circuits and Systems (Vol. 6)