On the Equivalence between the Set Covering Problem and the Problem of Finding Optimal Cumulative Assignment Schemes

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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.