Author:
Hochbaum Dorit S.,Levin Asaf
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Athanassopoulos, S., Caragiannis, I., Kaklamanis, C.: Analysis of approximation algorithms for k-set cover using factor-revealing linear programs. In: FCT 2007. Proceedings of the 16th International Symposium on Fundamentals of Computation Theory (to appear, 2007)
2. Cheng, Y., Church, G.M.: Biclustering of expression data. In: Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology (ISMB), pp. 93–103 (2000)
3. Chvátal, V.: A greedy heuristic for the set-covering problem. Mathematics of Operations Research 4, 233–235 (1979)
4. Crescenzi, P., Kann, V.: A compendium of NP optimization problems (1995), http://www.nada.kth.se/theory/problemlist.html
5. Dor, D., Tarsi, M.: Graph decomposition is NP-complete: a complete proof of Holyer’s conjecture. SIAM J. Comput. 26, 1166–1187 (1997)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献