Probabilistic Analysis of Rectilinear Steiner Trees

Authors:
Chunhong Chen
Affiliations:
Department of Electrical and Computer Engineering, University of Windsor, Ontario, Canada
Venue:
ASP-DAC '02 Proceedings of the 2002 Asia and South Pacific Design Automation Conference
Year:
2002

Citing 4
Cited 0

Performance optimization of VLSI interconnect layout

Integration, the VLSI Journal
An O(n log n) Algorithm for Rectilinear Minimal Spanning Trees

Journal of the ACM (JACM)
Creating and exploiting flexibility in steiner trees

Proceedings of the 38th annual Design Automation Conference
Steiner tree optimization for buffers, blockages, and bays

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Steiner tree is a fundamental problem in the automatic interconnect optimization for VLSI design.We present a probabilistic analysis method for constructing rectilinear Steiner trees.The best solution under statistical sense is obtained for any given set of N points.Experiments show that our results are better than those by the previous technique or very close to the optima.