Author:
Arif Umair,Benkoczi Robert,Gaur Daya Ram,Krishnamurti Ramesh
Publisher
Springer International Publishing
Reference25 articles.
1. Arif, U.M.: On primal-dual schema for the minimum satisfiability problem. Master’s thesis, University of Lethbridge, Canada (2017)
2. Bar-Yehuda, R., Even, S.: A linear-time approximation algorithm for the weighted vertex cover problem. J. Algorithms 2(2), 198–203 (1981). ISSN 0196–6774
3. Bar-Yehuda, R., Even, S.: A local-ratio theorem for approximating the weighted vertex cover problem. North-Holland Math. Stud. 109, 27–45 (1985)
4. Berman, P., Fujito, T.: On approximation properties of the independent set problem for low degree graphs. Theory Comput. Syst. 32(2), 115–132 (1999)
5. Bertsimas, D., Teo, C., Vohra, R.: On dependent randomized rounding algorithms. Oper. Res. Lett. 24(3), 105–114 (1999)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献