1. N. Boland, C. Fricke, G. Froyland, R. Sotirov, Clique-based facets for the precedence constrained knapsack problem, Technical report, Tilburg University Repository, Netherlands, http://arno.uvt.nl/oai/wo.uvt.nl.cgi, 2005.
2. A threshold of lnn for approximating set cover;Feige;J. ACM,1998
3. Note: On the set-union knapsack problem;Goldschmidt;Naval Res. Logist.,1994
4. P.R. Goundan, A.S. Schulz, Revisiting the greedy approach to submodular set function maximization, Preprint, 2007.
5. M. Hajiaghayi, K. Jain, K. Konwar, L. Lau, The minimum k-colored subgraph problem in haplotyping and DNA primer selection, in: Proc. Int. Workshop on Bioinformatics Research and Applications, Jan. 2006.