Author:
Boppana Ravi,Halldórsson Magnús M.
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. M. Ajtai, J. Komlós, and E. Szemerédi. A note on Ramsey numbers. J. Combin. Theory A, 29:354–360, 1980.
2. R. Bar-Yehuda and S. Even. A $$2 - \frac{{\log \log n}}{{2\log n}}$$ performance ratio for the weighted vertex cover problem. Technical Report #260, Technion, Haifa, January 1983.
3. B. Berger and J. Rompel. A better performance guarantee for approximate graph coloring. Algorithmica, 1990. to appear.
4. P. Berman and G. Schnitger. On the complexity of approximating the independent set problem. In Proc. Symp. Theoret. Aspects of Comp. Sci., pages 256–268. Springer-Verlag Lecture Notes in Comp. Sci. # 349, 1989.
5. A. Blum. Some tools for approximate 3-coloring. Unpublished manuscript, 1989.
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献