G Lin, H Xu, X Chen, J Guan - Expert Systems with Applications, 2020 - Elsevier
Given a row set M and a column set C, where each column in C covers several rows of M,
the maximum set k-covering problem (MKCP) is to select k columns from C, such hat the …