Author:
Alimonti Paola,Calamoneri Tiziana
Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. P. Berman, M. Fürer, Approximating Maximum Independent Set in Bounded Degree Graphs, Proc. 5-th Ann. ACM-SIAM Symp. on Discrete Algorithms, ACM-SIAM, 365–371, 1994.
2. M. Bellare, O. Goldreich, M. Sudan, Free Bits, PCPs and non-approximability towards tight results, Proc. of the 36th Annual IEEE Conference on Foundations of Computer Science, 1995.
3. P. Crescenzi and V. Kann, A Compendium of NP Optimization Problems, Manuscript, 1995.
4. R. Greenlaw and R. Petreschi, Cubic graphs, ACM Computing Surveys, 27, 471–495, 1995.
5. M.M. Halldorsson, Approximating the minimum maximal independence number, Inform. Process. Lett., 46, 169–172, 1993.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献