A PTAS for the metric case of the optimum weighted source–destination communication spanning tree problem (2019)
- Authors:
- Autor USP: FERREIRA, CARLOS EDUARDO - IME
- Unidade: IME
- DOI: 10.1016/j.tcs.2018.11.008
- Subjects: TEORIA DOS GRAFOS; ALGORITMOS DE APROXIMAÇÃO
- Keywords: optimum communication spanning tree problem; polynomial-time approximation scheme; metric problem
- Language: Inglês
- Imprenta:
- Source:
- Título: Theoretical Computer Science
- ISSN: 0304-3975
- Volume/Número/Paginação/Ano: v. 771, p. 9-22, 2019
- Este periódico é de assinatura
- Este artigo é de acesso aberto
- URL de acesso aberto
- Cor do Acesso Aberto: bronze
- Licença: publisher-specific-oa
-
ABNT
RAVELO, Santiago Valdés e FERREIRA, Carlos Eduardo. A PTAS for the metric case of the optimum weighted source–destination communication spanning tree problem. Theoretical Computer Science, v. 771, p. 9-22, 2019Tradução . . Disponível em: https://doi.org/10.1016/j.tcs.2018.11.008. Acesso em: 27 dez. 2025. -
APA
Ravelo, S. V., & Ferreira, C. E. (2019). A PTAS for the metric case of the optimum weighted source–destination communication spanning tree problem. Theoretical Computer Science, 771, 9-22. doi:10.1016/j.tcs.2018.11.008 -
NLM
Ravelo SV, Ferreira CE. A PTAS for the metric case of the optimum weighted source–destination communication spanning tree problem [Internet]. Theoretical Computer Science. 2019 ; 771 9-22.[citado 2025 dez. 27 ] Available from: https://doi.org/10.1016/j.tcs.2018.11.008 -
Vancouver
Ravelo SV, Ferreira CE. A PTAS for the metric case of the optimum weighted source–destination communication spanning tree problem [Internet]. Theoretical Computer Science. 2019 ; 771 9-22.[citado 2025 dez. 27 ] Available from: https://doi.org/10.1016/j.tcs.2018.11.008 - A PTAS for the metric case of the minimum sum-requirement 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
- A dynamic programming algorithm for the tree mapping problem
Informações sobre o DOI: 10.1016/j.tcs.2018.11.008 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
2914789.pdf | Direct link | |
 |
2914789.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
