An application algorithm for the via minimization problem in channel routing

It is shown that the problem of via minimization in VLSI routing with movable terminals can be solved in O(n log n) time by using the algorithm finding a maximum independent set in a permutation graph. It is also shown that the nets of an example are routed with fewer tracks and vias. Therefore, the number of vias is reduced by using a correct algorithm rather than an algorithm finding a length of largest up-sequence.<>