Complexity and approximability of minimum path-collection exact covers (2023)
Ravelo, Santiago Valdés 
; Fernandes, Cristina Gomes
Source: Theoretical Computer Science. Unidade: IME
Subjects: CIÊNCIA DA COMPUTAÇÃO, ALGORITMOS DE APROXIMAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
RAVELO, Santiago Valdés e FERNANDES, Cristina Gomes. Complexity and approximability of minimum path-collection exact covers. Theoretical Computer Science, v. 942, p. 21-32, 2023Tradução . . Disponível em: https://doi.org/10.1016/j.tcs.2022.11.022. Acesso em: 03 jan. 2026.APA
Ravelo, S. V., & Fernandes, C. G. (2023). Complexity and approximability of minimum path-collection exact covers. Theoretical Computer Science, 942, 21-32. doi:10.1016/j.tcs.2022.11.022NLM
Ravelo SV, Fernandes CG. Complexity and approximability of minimum path-collection exact covers [Internet]. Theoretical Computer Science. 2023 ; 942 21-32.[citado 2026 jan. 03 ] Available from: https://doi.org/10.1016/j.tcs.2022.11.022Vancouver
Ravelo SV, Fernandes CG. Complexity and approximability of minimum path-collection exact covers [Internet]. Theoretical Computer Science. 2023 ; 942 21-32.[citado 2026 jan. 03 ] Available from: https://doi.org/10.1016/j.tcs.2022.11.022
