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