1-Steiner tree problem in lambda-3 geometry plane

Guo Hui Lin, Andrew P. Thurber, Guoliang Xue

Research output: Chapter in Book/Report/Conference proceedingChapter

3 Scopus citations

Abstract

In this paper, we extend the 1-Steiner idea of Georgakopoulos and Papadimitriou to the Steiner tree problem in lambda-3 geometry plane. Our extension to the lambda-3 geometry plane and that of Kahng and Robins to the rectilinear plane are similar in principle, but different in many nontrivial details. After presenting an efficient algorithm for solving the 1-Steiner tree problem, we apply the iterated 1-Steiner heuristic to compute approximations to the Steiner minimum tree problem in lambda-3 geometry plane. Computational results on standard benchmarks show that our algorithm compares favorably with previously published heuristics.

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 '1-Steiner tree problem in lambda-3 geometry plane'. Together they form a unique fingerprint.

  • Cite this

    Lin, G. H., Thurber, A. P., & Xue, G. (1999). 1-Steiner tree problem in lambda-3 geometry plane. In Proceedings - IEEE International Symposium on Circuits and Systems (Vol. 6)