Author:
Faria Luerbio,Herrera de Figueiredo Celina M.,Mendonga Candido F.X.
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference5 articles.
1. S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy, Proof verification and hardness of approximation problems, in Proc. IEEE Symposium on Foundations of Computer Science, FOCS'92, pp. 14-23.
2. A better approximation algorithm for finding planar subgraphs;Calinescu;J. Algorithms,1998
3. Splitting Number is NP-Complete;Faria;Discrete Appl. Math.,2001
4. Optimization, approximation, and complexity classes;Papadimitriou;J. Comput. System Sci.,1991
5. Edge-deletion problems;Yannakakis;SIAM J. Comput.,1981
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献