Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference8 articles.
1. Elbassioni, K., R. Raman, S. Ray and R. Sitters, On the approximability of the maximum feasible subsystem problem with 0/1-coefficients, Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA (2009), 1210-1219.
2. Uniquely restricted matchings;Golumbic;Algorithmica,2001
3. Clique is hard to approximate within n1−ε;Håstad;Acta Mathematica,1999
4. Approximations of weighted independent set and hereditary subset problems;Haldórsson;Jr. of Graph Algorithms and Applications,2000
5. Ranks of zero patterns and sign patterns;Hershkowitz;Linear and Multilinear Algebra,1993
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献