Maze routing with buffer insertion and wiresizing

Abstract

<italic>We propose an elegant formulation of the Maze Routing with Buffer Insertion and Wiresizing pr oblem as a graph-the oretic shortest path problem. This formulation provides time and space performance improvements over previously proposed dynamic-programming based techniques. R outing c onstr aints such as wiring obstacles and restrictions on buffer… (More)
DOI: 10.1145/337292.337500

Topics

9 Figures and Tables

Cite this paper

@inproceedings{Lai2000MazeRW, title={Maze routing with buffer insertion and wiresizing}, author={Minghorng Lai and Martin D. F. Wong}, booktitle={IEEE Trans. on CAD of Integrated Circuits and Systems}, year={2000} }