Grade of service Euclidean Steiner minimum trees

Guoliang Xue, Guo Hui Lin, Ding Zhu Du

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

In this paper, we study the grade of service Steiner tree (GOSST) problem - a generalization of the Euclidean Steiner minimum tree problem. We present efficient approximation algorithms for the special cases where there are only two or three grades of service requests. We also present an exact algorithm and a powerful 5-optimal heuristic algorithm for the general case, together with computational results.

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 'Grade of service Euclidean Steiner minimum trees'. Together they form a unique fingerprint.

  • Cite this

    Xue, G., Lin, G. H., & Du, D. Z. (1999). Grade of service Euclidean Steiner minimum trees. In Proceedings - IEEE International Symposium on Circuits and Systems (Vol. 6)