Improved approximation algorithms for capacitated fault-tolerant k-center (2016)
- Authors:
- Autor USP: FERNANDES, CRISTINA GOMES - IME
- Unidade: IME
- DOI: 10.1007/978-3-662-49529-2_33
- Subjects: CIÊNCIA DA COMPUTAÇÃO; OTIMIZAÇÃO COMBINATÓRIA
- Language: Inglês
- Imprenta:
- Source:
- Título: Proceedings
- Conference titles: Latin American Theoretical Informatics Symposium - LATIN
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
FERNANDES, Cristina Gomes e PAULA, Samuel P. de. Improved approximation algorithms for capacitated fault-tolerant k-center. 2016, Anais.. Berlin: Springer, 2016. Disponível em: https://doi.org/10.1007/978-3-662-49529-2_33. Acesso em: 06 nov. 2024. -
APA
Fernandes, C. G., & Paula, S. P. de. (2016). Improved approximation algorithms for capacitated fault-tolerant k-center. In Proceedings. Berlin: Springer. doi:10.1007/978-3-662-49529-2_33 -
NLM
Fernandes CG, Paula SP de. Improved approximation algorithms for capacitated fault-tolerant k-center [Internet]. Proceedings. 2016 ;[citado 2024 nov. 06 ] Available from: https://doi.org/10.1007/978-3-662-49529-2_33 -
Vancouver
Fernandes CG, Paula SP de. Improved approximation algorithms for capacitated fault-tolerant k-center [Internet]. Proceedings. 2016 ;[citado 2024 nov. 06 ] Available from: https://doi.org/10.1007/978-3-662-49529-2_33 - Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
- Kinetic clustering of points on the line
- Multicuts in unweighted digraphs with bounded degree and bounded tree-width
- Independent dominating sets in planar triangulations
- On Tuza’s conjecture for triangulations and graphs with small treewidth
- On edge-magic labelings of forests
- Problemas circulatorios em grafos
- A better approximation ratio for the minimum k-edge-connected spanning subgraph problem
- A new approximation algorithm for finding heavy planar subgraphs
- Approximation algorithms for the max-buying problem with limited supply
Informações sobre o DOI: 10.1007/978-3-662-49529-2_33 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
