Leafy spanning arborescences in DAGs (2020)
- Authors:
- Autor USP: FERNANDES, CRISTINA GOMES - IME
- Unidade: IME
- DOI: 10.1007/978-3-030-61792-9_5
- Subjects: TEORIA DOS GRAFOS; ALGORITMOS E ESTRUTURAS DE DADOS; ALGORITMOS DE APROXIMAÇÃO
- Keywords: maximum leaf spanning arborescence; directed acyclic graphs; maximum leaf weighted spanning arborescence
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Conference titles: Latin American Symposium - LATIN
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
ABNT
FERNANDES, Cristina Gomes e LINTZMAYER, Carla Negri. Leafy spanning arborescences in DAGs. 2020, Anais.. Cham: Springer, 2020. Disponível em: https://doi.org/10.1007/978-3-030-61792-9_5. Acesso em: 06 fev. 2026. -
APA
Fernandes, C. G., & Lintzmayer, C. N. (2020). Leafy spanning arborescences in DAGs. In LATIN 2020 : theoretical informatics. Cham: Springer. doi:10.1007/978-3-030-61792-9_5 -
NLM
Fernandes CG, Lintzmayer CN. Leafy spanning arborescences in DAGs [Internet]. LATIN 2020 : theoretical informatics. 2020 ;[citado 2026 fev. 06 ] Available from: https://doi.org/10.1007/978-3-030-61792-9_5 -
Vancouver
Fernandes CG, Lintzmayer CN. Leafy spanning arborescences in DAGs [Internet]. LATIN 2020 : theoretical informatics. 2020 ;[citado 2026 fev. 06 ] Available from: https://doi.org/10.1007/978-3-030-61792-9_5 - 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.1007/978-3-030-61792-9_5 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
3016791.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
