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 language | English (US) |
|---|---|
| Title of host publication | Proceedings - IEEE International Symposium on Circuits and Systems |
| Volume | 6 |
| State | Published - 1999 |
| Externally published | Yes |
| Event | Proceedings of the 1999 IEEE International Symposium on Circuits and Systems, ISCAS '99 - Orlando, FL, USA Duration: May 30 1999 → Jun 2 1999 |
Other
| Other | Proceedings of the 1999 IEEE International Symposium on Circuits and Systems, ISCAS '99 |
|---|---|
| City | Orlando, FL, USA |
| Period | 5/30/99 → 6/2/99 |
ASJC Scopus subject areas
- Electronic, Optical and Magnetic Materials
- Electrical and Electronic Engineering