Bounded diameter minimum spanning trees and related problems
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Clock routing for high-performance ICs
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
High-performance clock routing based on recursive geometric matching
DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
On the bounded-skew clock and Steiner routing problems
DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
Bounded-skew clock and Steiner routing under Elmore delay
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Constructing Minimal Spanning/Steiner Trees with Bounded Path Length
EDTC '96 Proceedings of the 1996 European conference on Design and Test
Provably good performance-driven global routing
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
| Hi-index | 0.00 |
This paper presents an exact algorithm and two heuristics for solving the Bounded path length Minimal Spanning Tree (BMST) problem. The exact algorithm which is based on iterative negative-sum-exchanges(s) has polynomial space complexity and is hence more practical than the method presented by Gabow. The first heuristic method (BKRUS) is based on the classical Kruskal MST construction. For any given value of parameter @?, the algorithm constructs a routing tree with the longest interconnection path length at most (1 + @?)R, and empirically with cost at most 1.19 cost(BMST^*) where R is the length of the direct path from the source to the farthest sink and BMST^* is the optimal bounded path length MST. The second heuristic combines BKRUS and negative-sum-exchange(s) of depth 2 to generate even better results (more stable local minimum). Extensions of these techniques to the bounded path length Minimal Steiner Trees, using the Elmore delay model, and the construction of MSTs with lower and upper bounded path lengths are presented as well. Empirical results demonstrate the effectiveness of these algorithms on a large benchmark set.