Cryptology ePrint Archive: Report 2012/245

Available versions in chronological order

20120503:095346 (posted 03-May-2012 09:53:46 UTC): On the Equivalence between the Set Covering Problem and the Problem of Finding Optimal Cumulative Assignment Schemes; Qiang Li and Xiangxue Li and Dong Zheng and Zheng Huang and Kefei Chen

[ Cryptology ePrint archive ]