Leafy spanning k-forests (2022)
- Authors:
- Autor USP: FERNANDES, CRISTINA GOMES - IME
- Unidade: IME
- DOI: 10.1007/s10878-022-00872-z
- Assunto: ALGORITMOS DE APROXIMAÇÃO
- Keywords: Maximum Leaf Spanning Tree Problem; Graphs; Spanning Forests
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título: Journal of Combinatorial Optimization
- ISSN: 1382-6905
- Volume/Número/Paginação/Ano: v. 44, n. 2, p. 934-946, 2022
- Status:
- Nenhuma versão em acesso aberto identificada
-
ABNT
FERNANDES, Cristina Gomes e LINTZMAYER, Carla Negri e SAN FELICE, Mário César. Leafy spanning k-forests. Journal of Combinatorial Optimization, v. 44, n. 2, p. 934-946, 2022Tradução . . Disponível em: https://doi.org/10.1007/s10878-022-00872-z. Acesso em: 15 abr. 2026. -
APA
Fernandes, C. G., Lintzmayer, C. N., & San Felice, M. C. (2022). Leafy spanning k-forests. Journal of Combinatorial Optimization, 44( 2), 934-946. doi:10.1007/s10878-022-00872-z -
NLM
Fernandes CG, Lintzmayer CN, San Felice MC. Leafy spanning k-forests [Internet]. Journal of Combinatorial Optimization. 2022 ; 44( 2): 934-946.[citado 2026 abr. 15 ] Available from: https://doi.org/10.1007/s10878-022-00872-z -
Vancouver
Fernandes CG, Lintzmayer CN, San Felice MC. Leafy spanning k-forests [Internet]. Journal of Combinatorial Optimization. 2022 ; 44( 2): 934-946.[citado 2026 abr. 15 ] Available from: https://doi.org/10.1007/s10878-022-00872-z - 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
- 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
- Procedia Computer Science
Informações sobre a disponibilidade de versões do artigo em acesso aberto coletadas automaticamente via oaDOI API (Unpaywall).
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
