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 acesso aberto
- Este artigo NÃO é de acesso aberto
-
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: 14 fev. 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.022 -
NLM
Ravelo SV, Fernandes CG. Complexity and approximability of minimum path-collection exact covers [Internet]. Theoretical Computer Science. 2023 ; 942 21-32.[citado 2026 fev. 14 ] 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 2026 fev. 14 ] Available from: https://doi.org/10.1016/j.tcs.2022.11.022 - A systematic approach to bound factor revealing LPs and its application to the metric and squared metric facility location problems
- Improved approximation algorithms for capacitated fault-tolerant k-center
- Problemas circulatorios em grafos
- Second-price ad auctions with binary bids and markets with good competition
- A better approximation algorithm for finding planar subgraphs
- Guest Editorial: Special Issue on Latin American Theoretical Informatics Symposium (LATIN)
- A better approximation ratio for the minimum k-edge-connected spanning subgraph problem
- Approximating minimum k-section in trees with linear diameter
- Approximation algorithms for the max-buying problem with limited supply
- Trajectory clustering of points in R
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
