PTAS’s for some metric p-source communication spanning tree problems (2015)
Ravelo, Santiago Valdés; Ferreira, Carlos Eduardo 
Fonte: Proceedings. Nome do evento: International Workshop on Algorithms and Computation - WALCOM. Unidade: IME
Assuntos: OTIMIZAÇÃO COMBINATÓRIA, ALGORITMOS, MATEMÁTICA DISCRETA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
RAVELO, Santiago Valdés e FERREIRA, Carlos Eduardo. PTAS’s for some metric p-source communication spanning tree problems. 2015, Anais.. Cham: Springer, 2015. Disponível em: https://doi.org/10.1007/978-3-319-15612-5_13. Acesso em: 19 nov. 2024.APA
Ravelo, S. V., & Ferreira, C. E. (2015). PTAS’s for some metric p-source communication spanning tree problems. In Proceedings. Cham: Springer. doi:10.1007/978-3-319-15612-5_13NLM
Ravelo SV, Ferreira CE. PTAS’s for some metric p-source communication spanning tree problems [Internet]. Proceedings. 2015 ;[citado 2024 nov. 19 ] Available from: https://doi.org/10.1007/978-3-319-15612-5_13Vancouver
Ravelo SV, Ferreira CE. PTAS’s for some metric p-source communication spanning tree problems [Internet]. Proceedings. 2015 ;[citado 2024 nov. 19 ] Available from: https://doi.org/10.1007/978-3-319-15612-5_13
