Funder
Consejo Nacional de Ciencia y Tecnología
Publisher
Springer Science and Business Media LLC
Subject
Control and Optimization,Business, Management and Accounting (miscellaneous)
Reference42 articles.
1. Agrawal, A., Klein, P., Ravi, R.: When trees collide: An approximation algorithm for the generalized steiner problem on networks. SIAM J. Comput. 24(3), 440–456 (1995)
2. Alekseev, V.E., Boliac, R., Korobitsyn, D.V., Lozin, V.V.: Np-hard graph problems and boundary classes of graphs. Theoret. Comput. Sci. 389(1–2), 219–236 (2007)
3. Anand, R., Aggarwal, D., Kumar, V.: A comparative analysis of optimization solvers. J. Stat. Manag. Syst. 20(4), 623–635 (2017)
4. Baker, B.S.: Approximation algorithms for np-complete problems on planar graphs. J. ACM (JACM) 41(1), 153–180 (1994)
5. Bansal, N.: Approximating independent sets in sparse graphs. In: proceedings of the twenty-sixth annual ACM-SIAM symposium on discrete algorithms, pp. 1–8. SIAM (2014)