Enhanced Heuristic Algorithms K-LAG-V and K-LAG-S for the Constrained Via Minimization Problem

CVM requires finding any layer assignment of wire-segments, whose topology has already been given, so that the total number of vias may be minimized. A given topology of wire-segments is called an initial wiring layout. Let kCVM denote CVM in which k layers are available for routing. In this paper, only rectilinear routing is considered. The subject of the paper is to propose heuristic algorithms K-LAG-V and K-LAG-S that are enhanced versions of K-LAG. Based on experimental results, it is shown that they are promising ones for solving kCVM with k ∈ {4, 12}.