Chvatal, V. A greedy heuristic for the set-covering problem. (English) Zbl 0443.90066 Math. Oper. Res. 4, 233-235 (1979). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 7 ReviewsCited in 423 Documents MSC: 90C09 Boolean programming Keywords:greedy heuristic; set-covering problem; binary matrix; approximate solution; asymptotic exactness estimation × Cite Format Result Cite Review PDF Full Text: DOI