A dynamic programming algorithm for the tree mapping problem (2011)
- Authors:
- Autor USP: FERREIRA, CARLOS EDUARDO - IME
- Unidade: IME
- DOI: 10.1016/j.endm.2011.05.026
- Assunto: PROGRAMAÇÃO DINÂMICA
- Keywords: tree mapping; dynamic programming
- Language: Inglês
- Imprenta:
- Source:
- Título: Electronic Notes in Discrete Mathematics
- ISSN: 1571-0653
- Volume/Número/Paginação/Ano: v. 37, p. 147-152, 2011
- Conference titles: LAGOS'11 – VI Latin-American Algorithms, Graphs and Optimization Symposium
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
FERREIRA, Carlos Eduardo e FREIRE, A. S. e PUGLIA, G. A. A dynamic programming algorithm for the tree mapping problem. Electronic Notes in Discrete Mathematics, v. 37, p. 147-152, 2011Tradução . . Disponível em: https://doi.org/10.1016/j.endm.2011.05.026. Acesso em: 27 dez. 2025. -
APA
Ferreira, C. E., Freire, A. S., & Puglia, G. A. (2011). A dynamic programming algorithm for the tree mapping problem. Electronic Notes in Discrete Mathematics, 37, 147-152. doi:10.1016/j.endm.2011.05.026 -
NLM
Ferreira CE, Freire AS, Puglia GA. A dynamic programming algorithm for the tree mapping problem [Internet]. Electronic Notes in Discrete Mathematics. 2011 ; 37 147-152.[citado 2025 dez. 27 ] Available from: https://doi.org/10.1016/j.endm.2011.05.026 -
Vancouver
Ferreira CE, Freire AS, Puglia GA. A dynamic programming algorithm for the tree mapping problem [Internet]. Electronic Notes in Discrete Mathematics. 2011 ; 37 147-152.[citado 2025 dez. 27 ] Available from: https://doi.org/10.1016/j.endm.2011.05.026 - A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem
- A PTAS for the metric case of the optimum weighted source–destination communication spanning tree problem
- Some formulations for the group Steiner tree problem
- Decomposing matrices into blocks
- Some integer programs arising in the design of main frame computers
- PTAS’s for some metric p-source communication spanning tree problems
- Parallelisation of a multi-neighbourhood local search heuristic for a phylogeny problem
- Syntenic global alignment and its application to the gene prediction problem
- The node capacitated graph pertitioning problem: a computational study
- The biclique k-clustering problem in bipartite graphs and its application in bioinformatics
Informações sobre o DOI: 10.1016/j.endm.2011.05.026 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
