Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. P. Berman and M. Fürer. Approximating maximum independent set in bounded degree graphs. In Proc. Fifth Ann, ACM-SIAM Symp. on Discrete Algorithms, pages 365–371, Jan. 1994.
2. B. Bollobás. Extremal Graph Theory. Academic Press, 1978.
3. P. Crescenzi and V. Kann. A compendium of NP optimization problems. Dynamic on-line survey available at nada.kth.se, 1995.
4. M. Demange, P. Grisoni, and V. T. Paschos. Approximation results for the minimum graph coloring problem. Inform. Process. Lett., 50:19–23, 1994.
5. O. Goldschmidt, D. S. Hochbaum, and G. Yu. A modified greedy heuristic for the set covering problem with improved worst case bound. Inform. Process. Lett., 48:305–310, 1993.
Cited by
31 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献