Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference22 articles.
1. I. Dinur, S. Safra, Approximating vertex cover within a factor better than 1.36 is NP-hard, in: STOC ’02: Proceedings of the Thiry-Fourth Annual ACM Symposium on Theory of Computing. 33–42 , 2002.
2. On the complexity of timetable and multicommodity flow problems;Even;SIAM J. Comput.,1976
3. G. Goel, C. Karande, P. Tripathi, L. Wang, Approximability of combinatorial problems with multi-agent submodular cost functions, in: Proc. 50th IEEE Symp. on Foundations of Computer Science, 2009, pp. 755–764.
4. Geometric Algorithms and Combinatorial Optimization;Grötschel,1988
5. J. Hastad, Clique is hard to approximate within n1−ϵ, in: Proc. 37th IEEE Symp. on Foundations of Computer Science, 1996, pp. 627–636.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献