Approximation algorithms for the max-buying problem with limited supply (2014)
Source: LATIN 2014: theoretical informatics: Proceedings. Conference titles: Latin American on Theoretical Informatics Symposium - LATIN 2014. Unidade: IME
Subjects: OTIMIZAÇÃO COMBINATÓRIA, TEORIA DOS JOGOS, ALGORITMOS DE APROXIMAÇÃO, ALGORITMOS E ESTRUTURAS DE DADOS
ABNT
FERNANDES, Cristina Gomes e SCHOUERY, Rafael Crivellari Saliba. Approximation algorithms for the max-buying problem with limited supply. 2014, Anais.. Heidelberg: Springer, 2014. Disponível em: https://doi.org/10.1007/978-3-642-54423-1_61. Acesso em: 04 out. 2024.APA
Fernandes, C. G., & Schouery, R. C. S. (2014). Approximation algorithms for the max-buying problem with limited supply. In LATIN 2014: theoretical informatics: Proceedings. Heidelberg: Springer. doi:10.1007/978-3-642-54423-1_61NLM
Fernandes CG, Schouery RCS. Approximation algorithms for the max-buying problem with limited supply [Internet]. LATIN 2014: theoretical informatics: Proceedings. 2014 ;[citado 2024 out. 04 ] Available from: https://doi.org/10.1007/978-3-642-54423-1_61Vancouver
Fernandes CG, Schouery RCS. Approximation algorithms for the max-buying problem with limited supply [Internet]. LATIN 2014: theoretical informatics: Proceedings. 2014 ;[citado 2024 out. 04 ] Available from: https://doi.org/10.1007/978-3-642-54423-1_61