论文信息 - On solving covering problems

On solving covering problems

The set covering problem and the minimum cost assignment problem (respectively known as unate and binate covering problem) arise throughout the logic synthesis flow. This paper investigates the complexity and approximation ratio of two lower bound computation algorithms from both a theoretical and practical point of view. It also presents a new pruning technique that takes advantage of the partitioning.

Olivier Coudert | O. Coudert

[1] E. McCluskey. Minimization of Boolean functions , 1956 .

[2] W. Quine. On Cores and Prime Implicants of Truth Functions , 1959 .

[3] James F. Gimpel. A Reduction Technique for Prime Implicant Tables , 1964, IEEE Trans. Electron. Comput..

[4] Robert W. House,et al. Gimpel's Reduction Technique Extended to the Covering Problem with Costs , 1967, IEEE Trans. Electron. Comput..

[5] S. Rudeanu. Review: W. V. Quine, On Cores and Prime Implicants of Truth Functions , 1970 .

[6] Nripendra N. Biswas,et al. Minimization of Boolean Functions , 1971, IEEE Transactions on Computers.

[7] David S. Johnson,et al. Approximation algorithms for combinatorial problems , 1973, STOC.

[8] Vasek Chvátal,et al. A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[9] Alberto Sangiovanni-Vincentelli,et al. Logic synthesis for vlsi design , 1989 .

[10] Ravi B. Boppana,et al. Approximating maximum independent sets by excluding subgraphs , 1992, BIT Comput. Sci. Sect..

[11] Olivier Coudert,et al. Two-level logic minimization: an overview , 1994, Integr..

[12] Giovanni De Micheli,et al. Synthesis and Optimization of Digital Circuits , 1994 .

[13] Martyn Edwards,et al. Logic synthesis , 1994, Microprocessors and microsystems.

[14] Olivier Coudert,et al. New Ideas for Solving Covering Problems , 1995, 32nd Design Automation Conference.