The Community for Technology Leaders
Proceedings of the Second Great Lakes Symposium on VLSI (1992)
Kalamazoo, MI, USA
Feb. 28, 1992 to Feb. 29, 1992
ISBN: 0-8186-2610-0
pp: 159-166
C.J.-R. Shi , Dept. of Comput. Sci., Waterloo Univ., Ont., Canada
ABSTRACT
The author proposes a use of the notion of hypergraphs to describe the general constrained via minimization (CVM) problem. He shows that the formulation of the general CVM by means of hypergraphs turns out to be surprisingly simple and general. In the case of two-layer routing, a signed hypergraph model is introduced. On the basis of this model, the author develops a fast (linear-time) heuristic and obtains promising results; he also presents two methods of modeling multiway splits by graphs, producing better results than all the previous methods.<>
INDEX TERMS
circuit layout CAD,
CITATION

C. Shi, "A signed hypergraph model of constrained via minimization," Proceedings of the Second Great Lakes Symposium on VLSI(GLSV), Kalamazoo, MI, USA, , pp. 159-166.
doi:10.1109/GLSV.1992.218350
96 ms
(Ver 3.3 (11022016))