Back to Search
Start Over
New Approximation Algorithms for Routing with Multiport Terminals.
- Source :
-
IEEE Transactions on Computer-Aided Design of Integrated Circuits & Systems . Oct2000, Vol. 19 Issue 10, p1118. 11p. 3 Black and White Photographs, 9 Diagrams, 5 Charts. - Publication Year :
- 2000
-
Abstract
- Addresses the general problem of minimum-cost routing tree construction in the presence of multiport terminals, which gives rise to the group Steiner minimal tree problem. Details on the classical Steiner minimal tree problem; Concept of Steiner depth-bounded trees; Approximation of an optimal group Steiner tree; Runtime and practical optimizations; Instances with degenerate groups; Experimental results.
- Subjects :
- *ROUTING-machines
*STEINER systems
*STRUCTURAL optimization
Subjects
Details
- Language :
- English
- ISSN :
- 02780070
- Volume :
- 19
- Issue :
- 10
- Database :
- Academic Search Index
- Journal :
- IEEE Transactions on Computer-Aided Design of Integrated Circuits & Systems
- Publication Type :
- Academic Journal
- Accession number :
- 3705921
- Full Text :
- https://doi.org/10.1109/43.875285