An Algorithm for Approximating Set Cover and Its Application on Logic Circuit Optimization

The set covering question is NP-Hard problem on optimized combination. In this paper, we presented Simplifying and Selecting-Excellence Algorithm (SSE) based on the strategy. The main ideas of it: Before a most possible set was chosen, the set covering problem was simplified and the necessary sets were chosen. The obtained solution is more approximate to the exact solution than greedy algorithm. The time complexity is index level, but it is superior to O (m3 and mn2) when the connection degree is less than a certain range. In the multi-input logic circuit simplification, SSE algorithm is much better than QM algorithm.