The online multicommodity connected facility location problem (2018)
- Authors:
- Autor USP: FERNANDES, CRISTINA GOMES - IME
- Unidade: IME
- DOI: 10.1007/978-3-319-89441-6_10
- Subjects: OTIMIZAÇÃO COMBINATÓRIA; COMPUTABILIDADE E COMPLEXIDADE; TEORIA DA COMPUTAÇÃO
- Keywords: online algorithms; competitive analysis; facility location; Steiner Forest; rent-or-buy problems; randomized algorithms
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título do periódico: Proceedings
- Conference titles: International Workshop on Approximation and Online Algorithms - WAOA
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
SAN FELICE, Mário César e FERNANDES, Cristina Gomes e LINTZMAYER, Carla Negri. The online multicommodity connected facility location problem. 2018, Anais.. Cham: Springer, 2018. Disponível em: https://doi.org/10.1007/978-3-319-89441-6_10. Acesso em: 30 abr. 2024. -
APA
San Felice, M. C., Fernandes, C. G., & Lintzmayer, C. N. (2018). The online multicommodity connected facility location problem. In Proceedings. Cham: Springer. doi:10.1007/978-3-319-89441-6_10 -
NLM
San Felice MC, Fernandes CG, Lintzmayer CN. The online multicommodity connected facility location problem [Internet]. Proceedings. 2018 ;[citado 2024 abr. 30 ] Available from: https://doi.org/10.1007/978-3-319-89441-6_10 -
Vancouver
San Felice MC, Fernandes CG, Lintzmayer CN. The online multicommodity connected facility location problem [Internet]. Proceedings. 2018 ;[citado 2024 abr. 30 ] Available from: https://doi.org/10.1007/978-3-319-89441-6_10 - Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
- Kinetic clustering of points on the line
- Independent dominating sets in planar triangulations
- On Tuza’s conjecture for triangulations and graphs with small treewidth
- Multicuts in unweighted digraphs with bounded degree and bounded tree-width
- On edge-magic labelings of forests
- Reaction motifs in metabolic networks
- Maximum series-parallel subgraph
- A systematic approach to bound factor revealing LPs and its application to the metric and squared metric facility location problems
- Guest Editorial: Special Issue on Latin American Theoretical Informatics Symposium (LATIN)
Informações sobre o DOI: 10.1007/978-3-319-89441-6_10 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 | 2890482.pdf |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
