Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. M. Alekhnovich, S. Buss, S. Moran, and T. Pitassi. Minimum propositional proof length is NP-hard to linearly approximate. Manuscript, 1998.
2. S. Arora, L. Babai, J. Stern, and Z. Sweedyk. The hardness of approximate optima in lattices, codes and linear equations. In Proc. 34th IEEE Symp. on Foundations of Computer Science, pages 724–733, 1993.
3. Robert Carr, Srinivas Doddi, Goran Konjevod, and Madhav Marathe. On the red-blue set cover problem. In Proc. 11th ACM-SIAM Symp. on Discrete Algorithms, 2000.
4. V. Chvatal. A greedy heuristic for the set-covering problem. Math. of Oper. Res., 4:233–235, 1979.
5. I. Dinur and S. Safra. On the hardness of approximating label cover. Technical Report 15, Electronic Colloquium on Computational Complexity, 1999.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献