Author:
Escoffier Bruno,Paschos Vangelis Th.
Subject
General Computer Science,Theoretical Computer Science
Reference82 articles.
1. Approximation algorithms for combinatorial problems;Johnson;J. Comput. System Sci.,1974
2. S.A. Cook, The complexity of theorem-proving procedures, in: Proc. STOC’71, 1971, pp. 151–158
3. Reducibility among combinatorial problems;Karp,1972
4. Complexity and Approximation. Combinatorial Optimization Problems and their Approximability Properties;Ausiello,1999
5. Reductions, completeness and the hardness of approximability;Ausiello;European J. Oper. Res.,2006
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献