Complexity and approximability of minimum path-collection exact covers (2023)
- Authors:
- Autor USP: FERNANDES, CRISTINA GOMES - IME
- Unidade: IME
- DOI: 10.1016/j.tcs.2022.11.022
- Subjects: CIÊNCIA DA COMPUTAÇÃO; ALGORITMOS DE APROXIMAÇÃO
- Keywords: Exact edge cover; Computational complexity; Approximability; Polynomial-time algorithm; Combinatorial optimization
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título: Theoretical Computer Science
- ISSN: 0304-3975
- Volume/Número/Paginação/Ano: v. 942, p. 21-32, 2023
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
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: 29 dez. 2025. -
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.022 -
NLM
Ravelo SV, Fernandes CG. Complexity and approximability of minimum path-collection exact covers [Internet]. Theoretical Computer Science. 2023 ; 942 21-32.[citado 2025 dez. 29 ] Available from: https://doi.org/10.1016/j.tcs.2022.11.022 -
Vancouver
Ravelo SV, Fernandes CG. Complexity and approximability of minimum path-collection exact covers [Internet]. Theoretical Computer Science. 2023 ; 942 21-32.[citado 2025 dez. 29 ] Available from: https://doi.org/10.1016/j.tcs.2022.11.022 - Problemas circulatorios em grafos
- A better approximation ratio for the minimum k-edge-connected spanning subgraph problem
- A new approximation algorithm for finding heavy planar subgraphs
- Approximation algorithms for the max-buying problem with limited supply
- Geodesic stability for memoryless binary long-lived consensus
- A concurrent implementation of skip graphs
- Approximation algorithms for the Max-Buying problem with limited supply
- Nonempty intersection of longest paths in series-parallel graphs
- The online multicommodity connected facility location problem
- Reaction motifs in metabolic networks
Informações sobre o DOI: 10.1016/j.tcs.2022.11.022 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
3128774 - Complexity and ... | Direct link |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
