ACM Home Page
Please provide us with feedback. Feedback
On solving covering problems
Full text PdfPdf (332 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 33rd annual Design Automation Conference table of contents
Las Vegas, Nevada, United States
Pages: 197 - 202  
Year of Publication: 1996
ISBN:0-89791-779-0
Author
Olivier Coudert  Synopsys Inc., 700 East Middlefield Rd., Mountain View, CA
Sponsors
IEEE-CAS : Circuits & Systems
SIGDA: ACM Special Interest Group on Design Automation
EDAC : Electronic Design Automation Consortium
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 30,   Citation Count: 26
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/240518.240555
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
V. Chv~tal, "A Greedy Heuristic for the Set-Covering Problem", Math. Op. Res., 4-3, pp. 233-235, Aug. 1979.
4
 
5
 
6
 
7
J. F. Gimpel, "A Reduction Technique for Prime Implicant Tables", IEEE Trans. Elec. Comp., 14, pp. 535- 541, June 1965.
 
8
D. S. Johnson, "Approximation Algorithms for Combinatorial Problems", d. Comp. Sys. Sci., 9, 1974.
 
9
E. L. Jr. McCluskey, "Minimization of Boolean Functions", Bell Sys. Tech. dour., 35, pp. 1417-1444, April 1959.
 
10
 
11
W. V. O. Quine, "On Cores and Prime Implicants of Truth Functions", Am. Math. Monthly, 66, pp. 755-760, 1959.
 
12
S. Robinson, R. House, "Gimpel's Reduction Technique Extended to the Covering Problem With Costs", in IEEE Trans. Elec. Comp., 16, pp. 509-514, Aug. 1967.
 
13

CITED BY  26