Constructing Minimal Spanning/Steiner Trees with Bounded Path Length

Authors:
Iksoo Pyo;Jaewon Oh;Massoud Pedram
Affiliations:
JFl-61, Intel Corportation, Hillsboro, OR;Department of EE-Systems, University of Southern California, Los Angeles, CA;Department of EE-Systems, University of Southern California, Los Angeles, CA
Venue:
EDTC '96 Proceedings of the 1996 European conference on Design and Test
Year:
1996

Citing 2
Cited 3

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

A min-cost flow based min-cost rectilinear Steiner distance-preserving tree construction

Proceedings of the 1997 international symposium on Physical design
Constructing minimal spanning/Steiner trees with bounded path length

Integration, the VLSI Journal
A deep-submicron steiner tree

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

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-exchange(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 e, the algorithm constructs a routing tree with the longest interconnection path length at most (1 + e) times R, and empirically with cost at most 1.19 times 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 improve results. Extensions of these techniques to the bounded path length Minimal Steiner Trees, using the Elmore delay model are presented as well. Empirical results demonstrate the effectiveness of these algorithms on a large benchmark set.