A systematic approach to bound factor revealing LPs and its application to the metric and squared metric facility location problems (2012)
- Authors:
- Autor USP: FERNANDES, CRISTINA GOMES - IME
- Unidade: IME
- DOI: 10.1007/978-3-642-32512-0_13
- Assunto: OTIMIZAÇÃO COMBINATÓRIA
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título do periódico: Proceedings
- Conference titles: International Workshop on Approximation Algorithms for Combinatorial Optimization - APPROX
- Este periódico é de assinatura
- Este artigo é de acesso aberto
- URL de acesso aberto
- Cor do Acesso Aberto: green
-
ABNT
FERNANDES, Cristina Gomes et al. A systematic approach to bound factor revealing LPs and its application to the metric and squared metric facility location problems. 2012, Anais.. Berlin: Springer, 2012. Disponível em: https://doi.org/10.1007/978-3-642-32512-0_13. Acesso em: 13 maio 2024. -
APA
Fernandes, C. G., Meira, L. A. A., Miyazawa, F. K., & Pedrosa, L. L. C. (2012). A systematic approach to bound factor revealing LPs and its application to the metric and squared metric facility location problems. In Proceedings. Berlin: Springer. doi:10.1007/978-3-642-32512-0_13 -
NLM
Fernandes CG, Meira LAA, Miyazawa FK, Pedrosa LLC. A systematic approach to bound factor revealing LPs and its application to the metric and squared metric facility location problems [Internet]. Proceedings. 2012 ;[citado 2024 maio 13 ] Available from: https://doi.org/10.1007/978-3-642-32512-0_13 -
Vancouver
Fernandes CG, Meira LAA, Miyazawa FK, Pedrosa LLC. A systematic approach to bound factor revealing LPs and its application to the metric and squared metric facility location problems [Internet]. Proceedings. 2012 ;[citado 2024 maio 13 ] Available from: https://doi.org/10.1007/978-3-642-32512-0_13 - Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
- Kinetic clustering of points on the line
- On Tuza’s conjecture for triangulations and graphs with small treewidth
- Independent dominating sets in planar triangulations
- Multicuts in unweighted digraphs with bounded degree and bounded tree-width
- On edge-magic labelings of forests
- A better approximation algorithm for finding planar subgraphs
- Questões algorítmicas de natureza combinatória
- A better approximation ratio for the minimum k-edge-connected spanning subgraph problem
- Maximum series-parallel subgraph
Informações sobre o DOI: 10.1007/978-3-642-32512-0_13 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
