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: Proceedings
- Conference titles: International Workshop on Approximation Algorithms for Combinatorial Optimization - APPROX
- Este periódico é de acesso aberto
- Este artigo NÃO é de acesso aberto
-
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: 06 fev. 2026. -
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 2026 fev. 06 ] 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 2026 fev. 06 ] Available from: https://doi.org/10.1007/978-3-642-32512-0_13 - Improved approximation algorithms for capacitated fault-tolerant k-center
- Problemas circulatorios em grafos
- Second-price ad auctions with binary bids and markets with good competition
- A better approximation algorithm for finding planar subgraphs
- Guest Editorial: Special Issue on Latin American Theoretical Informatics Symposium (LATIN)
- A better approximation ratio for the minimum k-edge-connected spanning subgraph problem
- Approximating minimum k-section in trees with linear diameter
- Approximation algorithms for the max-buying problem with limited supply
- Trajectory clustering of points in R
- Procedia Computer Science
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
