A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem (2015)
- Authors:
- Autor USP: FERREIRA, CARLOS EDUARDO - IME
- Unidade: IME
- DOI: 10.1007/978-3-319-14974-5_2
- Subjects: OTIMIZAÇÃO COMBINATÓRIA; ALGORITMOS; MATEMÁTICA DISCRETA
- Language: Inglês
- Imprenta:
- Source:
- Conference titles: International Conference on Algorithms and Discrete Applied Mathematics - CALDAM
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
RAVELO, Santiago Valdés e FERREIRA, Carlos Eduardo. A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem. 2015, Anais.. Cham: Springer, 2015. Disponível em: https://doi.org/10.1007/978-3-319-14974-5_2. Acesso em: 19 abr. 2024. -
APA
Ravelo, S. V., & Ferreira, C. E. (2015). A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem. In Algorithms and Discrete Applied Mathematics: First International Conference, CALDAM 2015, Kanpur, India, February 8-10, 2015. Proceedings. Cham: Springer. doi:10.1007/978-3-319-14974-5_2 -
NLM
Ravelo SV, Ferreira CE. A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem [Internet]. Algorithms and Discrete Applied Mathematics: First International Conference, CALDAM 2015, Kanpur, India, February 8-10, 2015. Proceedings. 2015 ;[citado 2024 abr. 19 ] Available from: https://doi.org/10.1007/978-3-319-14974-5_2 -
Vancouver
Ravelo SV, Ferreira CE. A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem [Internet]. Algorithms and Discrete Applied Mathematics: First International Conference, CALDAM 2015, Kanpur, India, February 8-10, 2015. Proceedings. 2015 ;[citado 2024 abr. 19 ] Available from: https://doi.org/10.1007/978-3-319-14974-5_2 - A PTAS for the metric case of the optimum weighted source–destination communication spanning tree 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
- The node capacitated graph partitioning problem: a computational study
- Algoritmos Branch e Bound para o problema de sequenciamento em uma única máquina
- Preface to the Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium. [Editorial]
- Preface LAGOS’21 - XI Latin and American Algorithms, Graphs, and Optimization Symposium - São Paulo - Brazil. [Editorial]
- A gene prediction algorithm using the spliced alignment problem
- Some formulations for the group Steiner tree problem
Informações sobre o DOI: 10.1007/978-3-319-14974-5_2 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas