Procedia Computer Science (2021)
- Authors:
- Autor USP: FERREIRA, CARLOS EDUARDO - IME
- Unidade: IME
- Assunto: CIÊNCIA DA COMPUTAÇÃO
- Language: Inglês
- Imprenta:
- Source:
- ISSN: 1877-0509
- Volume/Número/Paginação/Ano: v. 195, p. 1-542, 2021
- Conference titles: Latin and American Algorithms, Graphs and Optimization Symposium - LAGOS
-
ABNT
Procedia Computer Science. . Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://www.sciencedirect.com/journal/procedia-computer-science/vol/195/suppl/C. Acesso em: 07 maio 2025. , 2021 -
APA
Procedia Computer Science. (2021). Procedia Computer Science. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Recuperado de https://www.sciencedirect.com/journal/procedia-computer-science/vol/195/suppl/C -
NLM
Procedia Computer Science [Internet]. 2021 ; 195 1-542.[citado 2025 maio 07 ] Available from: https://www.sciencedirect.com/journal/procedia-computer-science/vol/195/suppl/C -
Vancouver
Procedia Computer Science [Internet]. 2021 ; 195 1-542.[citado 2025 maio 07 ] Available from: https://www.sciencedirect.com/journal/procedia-computer-science/vol/195/suppl/C - 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
- 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]
- Some formulations for the group Steiner tree problem
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
