Abstract：In this paper, a heuristic approach for constrained via minimization for VLSI three-layer routing on the basis of segment-crossing graph model is presented. Two types of algorithm-global sense and local sense are combined into the new algorithm. In addition, many physical constraints are taken into consideration. According to the results, this algorithm is verified to be very efficient and encouraging.
马琪; 严晓浪. 一个VLSI三层布线通孔最少化的启发式算法[J]. 电子与信息学报, 2001, 23(10): 1014-1021 .
Ma Qi; Yan Xiaolang. A HEURISTIC ALGORITHM TO THREE-LAYER CONSTRAINED VIA MINIMIZATION. , 2001, 23(10): 1014-1021 .
2001, Vol. 23 
