Near to Optimal Size Selection in Combinatorial Circuits

What is it about?

This paper considers a problem of VLSI design occurring in the routing phase. The problem is to determine the optimal size selection for the gates in a combinatorial circuit which uses the problem of finding a shortest path in an oriented acyclic graph for updates between successive iterations. For this problem, an approximation algorithm is given.

Featured Image