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 Citations (Scopus)

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

Fingerprint

Geometry

ASJC Scopus subject areas

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

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)

1-Steiner tree problem in lambda-3 geometry plane. / Lin, Guo Hui; Thurber, Andrew P.; Xue, Guoliang.

Proceedings - IEEE International Symposium on Circuits and Systems. Vol. 6 1999.

Research output: Chapter in Book/Report/Conference proceedingChapter

Lin, GH, Thurber, AP & Xue, G 1999, 1-Steiner tree problem in lambda-3 geometry plane. in Proceedings - IEEE International Symposium on Circuits and Systems. vol. 6, Proceedings of the 1999 IEEE International Symposium on Circuits and Systems, ISCAS '99, Orlando, FL, USA, 5/30/99.
Lin GH, Thurber AP, Xue G. 1-Steiner tree problem in lambda-3 geometry plane. In Proceedings - IEEE International Symposium on Circuits and Systems. Vol. 6. 1999
Lin, Guo Hui ; Thurber, Andrew P. ; Xue, Guoliang. / 1-Steiner tree problem in lambda-3 geometry plane. Proceedings - IEEE International Symposium on Circuits and Systems. Vol. 6 1999.
@inbook{37f501a5dbfc47128b3cc5b8acc80aca,
title = "1-Steiner tree problem in lambda-3 geometry plane",
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.",
author = "Lin, {Guo Hui} and Thurber, {Andrew P.} and Guoliang Xue",
year = "1999",
language = "English (US)",
volume = "6",
booktitle = "Proceedings - IEEE International Symposium on Circuits and Systems",

}

TY - CHAP

T1 - 1-Steiner tree problem in lambda-3 geometry plane

AU - Lin, Guo Hui

AU - Thurber, Andrew P.

AU - Xue, Guoliang

PY - 1999

Y1 - 1999

N2 - 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.

AB - 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.

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

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

M3 - Chapter

AN - SCOPUS:0032633637

VL - 6

BT - Proceedings - IEEE International Symposium on Circuits and Systems

ER -