Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference6 articles.
1. Proof verification and hardness of approximation problems;Arora;Proc. 33rd Ann. IEEE Symp. on Foundations of Computer Science,1992
2. Approximation algorithms for NP-complete problems on planar graphs;Baker;Proc. 24th Ann. IEEE Symp. on Foundations of Computer Science,1983
3. Generalized planar matching;Berman;J. Algorithms,1990
4. Maximum bounded 3-dimensional matching is MAX SNP-complete;Kann;Inform. Process. Lett.,1991
5. On the approximability of NP-complete optimization problems;Kann,1992
Cited by
31 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献