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
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
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: 29 dez. 2025. -
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 2025 dez. 29 ] 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 2025 dez. 29 ] Available from: https://doi.org/10.1007/978-3-642-54423-1_61 - 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
- Geodesic stability for memoryless binary long-lived consensus
- Complexity and approximability of minimum path-collection exact covers
- A concurrent implementation of skip graphs
- Approximation algorithms for the Max-Buying problem with limited supply
- Nonempty intersection of longest paths in series-parallel graphs
- The online multicommodity connected facility location problem
- Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
Informações sobre o DOI: 10.1007/978-3-642-54423-1_61 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
