Author:
Grandoni Fabrizio,Könemann Jochen,Panconesi Alessandro
Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. Bar-Yehuda, R., Even, S.: A linear-time approximation algorithm for the weighted vertex cover problem. Journal of Algorithms 2, 198–203 (1981)
2. Chvátal, V.: Linear programming. W.H. Freeman, New York (1983)
3. Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to algorithms, 6th edn. MIT Press and McGraw-Hill Book Company (1992)
4. Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. Freemann (1979)
5. Halldórsson, M.M., Radhakrishnan, J.: Greed is good: Approximating independent sets in sparse and bounded-degree graphs. In: ACM Symposium on the Theory of Computing, pp. pp. 439–448, pp. 23–25 (1994)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献