Qiang Li, Xiangxue Li, Dong Zheng, Zheng Huang, Kefei Chen. On the Equivalence between the Set Covering Problem and the Problem of Finding Optimal Cumulative Assignment Schemes. IACR Cryptology ePrint Archive, 2012:245, 2012. [doi]
@article{LiLZHC12,
title = {On the Equivalence between the Set Covering Problem and the Problem of Finding Optimal Cumulative Assignment Schemes},
author = {Qiang Li and Xiangxue Li and Dong Zheng and Zheng Huang and Kefei Chen},
year = {2012},
url = {http://eprint.iacr.org/2012/245},
note = {informal publication},
researchr = {https://researchr.org/publication/LiLZHC12},
cites = {0},
citedby = {0},
journal = {IACR Cryptology ePrint Archive},
volume = {2012},
pages = {245},
}