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 periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
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: 20 jan. 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 jan. 20 ] 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 jan. 20 ] Available from: https://doi.org/10.1007/3-540-44666-4_19 - Approximation algorithms for the orthogonal Z-oriented three-dimensional packing problem
- Selfish 2D bin packing game
- Packing entering sets in kernel systems
- Balanced connected partitions of graphs: approximation, parameterization and lower bounds
- Grafos e otimização combinatória
- Hypotraceable digraphs
- The maximum agreement forest problem: approximation algorithms and computational experiments
- Minimum t-spanners on subcubic graphs
- The 2-Decomposition Conjecture for a new class of graphs
- An algorithmforthe three-dimensional packing problem with asymptotic performance analysis
Informações sobre o DOI: 10.1007/3-540-44666-4_19 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
