Source: Theoretical Computer Science. Unidade: IME
Subjects: TEORIA DOS GRAFOS, ALGORITMOS DE APROXIMAÇÃO
ABNT
RAVELO, Santiago Valdés e FERREIRA, Carlos Eduardo. A PTAS for the metric case of the optimum weighted source–destination communication spanning tree problem. Theoretical Computer Science, v. 771, p. 9-22, 2019Tradução . . Disponível em: https://doi.org/10.1016/j.tcs.2018.11.008. Acesso em: 24 set. 2024.APA
Ravelo, S. V., & Ferreira, C. E. (2019). A PTAS for the metric case of the optimum weighted source–destination communication spanning tree problem. Theoretical Computer Science, 771, 9-22. doi:10.1016/j.tcs.2018.11.008NLM
Ravelo SV, Ferreira CE. A PTAS for the metric case of the optimum weighted source–destination communication spanning tree problem [Internet]. Theoretical Computer Science. 2019 ; 771 9-22.[citado 2024 set. 24 ] Available from: https://doi.org/10.1016/j.tcs.2018.11.008Vancouver
Ravelo SV, Ferreira CE. A PTAS for the metric case of the optimum weighted source–destination communication spanning tree problem [Internet]. Theoretical Computer Science. 2019 ; 771 9-22.[citado 2024 set. 24 ] Available from: https://doi.org/10.1016/j.tcs.2018.11.008