Author:
Alimonti Paola,Kann Viggo
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. M. Ajtai. Recursive construction for 3-regular expanders. Proc. 28th Ann. IEEE Symp. on Foundations of Comput. Sci., 295–304, 1987.
2. E. Amaldi and V. Kann, The complexity and approximability of finding maximum feasible subsystems of linear relations. Theoret. Comput. Sci. 147, 181–210, 1995.
3. S. Arora and S. Safra, Probabilistic checking of proofs; a new characterization of NP. Proc. 33rd Annual IEEE Symp. Found. Comput. Sci. IEEE Comput. Soc., 2–13, 1992.
4. M. Bellare, O. Goldreich, and M. Sudan, Free Bits, PCPs and nonapproximability-towards tight results, Proc. of the 36th Annual IEEE Conference on Foundations of Computer Science, 422–431, 1995.
5. P. Berman and T. Fujito, On approximation properties of the independent set problem for degree 3 graphs, Proc. 3rd Workshop on Algorithms and Data Structures, Lecture Notes in Comput. Sci. 955, 449–460, Springer-Verlag, 1995.
Cited by
46 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献