Some approximation results for the maximum agreement forest problem (2001)
- Authors:
- Autor USP: WAKABAYASHI, YOSHIKO - IME
- Unidade: IME
- DOI: 10.1007/3-540-44666-4_19
- Assunto: ALGORITMOS GENÉTICOS
- Language: Inglês
- Imprenta:
- Source:
- Título: Proceedings
- Conference titles: International Workshop on Approximation Algorithms for Combinatorial Optimization Problems - APPROX 2001
- Este artigo NÃO possui versão em acesso aberto
-
Status: Nenhuma versão em acesso aberto identificada -
ABNT
RODRIGUES, Estela Maris e SAGOT, Marie-France e WAKABAYASHI, Yoshiko. Some approximation results for the maximum agreement forest problem. 2001, Anais.. Berlin: Springer, 2001. Disponível em: https://doi.org/10.1007/3-540-44666-4_19. Acesso em: 11 mar. 2026. -
APA
Rodrigues, E. M., Sagot, M. -F., & Wakabayashi, Y. (2001). Some approximation results for the maximum agreement forest problem. In Proceedings. Berlin: Springer. doi:10.1007/3-540-44666-4_19 -
NLM
Rodrigues EM, Sagot M-F, Wakabayashi Y. Some approximation results for the maximum agreement forest problem [Internet]. Proceedings. 2001 ;[citado 2026 mar. 11 ] Available from: https://doi.org/10.1007/3-540-44666-4_19 -
Vancouver
Rodrigues EM, Sagot M-F, Wakabayashi Y. Some approximation results for the maximum agreement forest problem [Internet]. Proceedings. 2001 ;[citado 2026 mar. 11 ] Available from: https://doi.org/10.1007/3-540-44666-4_19 - Packing in generalized kernel systems: a framework that generalizes packing of branchings
- Two-and three-dimensional parametric packing
- Tree 3-spanners on generalized prisms of graphs
- Quebra-cabecas e plano-decorte
- Approximation and parameterized algorithms for balanced connected partition problems
- Cube packing
- Two- and three-dimensional parametric packing
- On the structure of the monotone asymmetric travelling salesman polytope II: hypotraceable facets
- Polyhedral and computational results on the k-hop connected dominating set problem
- Polynomial-time approximation schemes for circle packing problems
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
