Approximation algorithms for the max-buying problem with limited supply (2014)
- Authors:
- Autor USP: FERNANDES, CRISTINA GOMES - IME
- Unidade: IME
- DOI: 10.1007/978-3-642-54423-1_61
- Subjects: OTIMIZAÇÃO COMBINATÓRIA; TEORIA DOS JOGOS; ALGORITMOS DE APROXIMAÇÃO; ALGORITMOS E ESTRUTURAS DE DADOS
- Keywords: pricing problem; unit-demand auctions
- Language: Inglês
- Imprenta:
- Publisher: Springer
- Publisher place: Heidelberg
- Date published: 2014
- Source:
- Conference titles: Latin American on Theoretical Informatics Symposium - LATIN 2014
- Status:
- Nenhuma versão em acesso aberto identificada
-
ABNT
FERNANDES, Cristina Gomes e SCHOUERY, Rafael Crivellari Saliba. Approximation algorithms for the max-buying problem with limited supply. 2014, Anais.. Heidelberg: Springer, 2014. Disponível em: https://doi.org/10.1007/978-3-642-54423-1_61. Acesso em: 01 abr. 2026. -
APA
Fernandes, C. G., & Schouery, R. C. S. (2014). Approximation algorithms for the max-buying problem with limited supply. In LATIN 2014: theoretical informatics: Proceedings. Heidelberg: Springer. doi:10.1007/978-3-642-54423-1_61 -
NLM
Fernandes CG, Schouery RCS. Approximation algorithms for the max-buying problem with limited supply [Internet]. LATIN 2014: theoretical informatics: Proceedings. 2014 ;[citado 2026 abr. 01 ] Available from: https://doi.org/10.1007/978-3-642-54423-1_61 -
Vancouver
Fernandes CG, Schouery RCS. Approximation algorithms for the max-buying problem with limited supply [Internet]. LATIN 2014: theoretical informatics: Proceedings. 2014 ;[citado 2026 abr. 01 ] Available from: https://doi.org/10.1007/978-3-642-54423-1_61 - A systematic approach to bound factor revealing LPs and its application to the metric and squared metric facility location problems
- Improved approximation algorithms for capacitated fault-tolerant k-center
- 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
- Trajectory clustering of points in R
- Procedia Computer Science
- Maximum series-parallel subgraph
Informações sobre a disponibilidade de versões do artigo em acesso aberto coletadas automaticamente via oaDOI API (Unpaywall).
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
