Approximation Algorithms for the Max-Buying Problem with Limited Supply-Reference-Cited by-同舟云学术

Approximation Algorithms for the Max-Buying Problem with Limited Supply

Published:2017-08-31 Issue:11 Volume:80 Page:2973-2992
ISSN:0178-4617
Container-title:Algorithmica
language:en
Short-container-title:Algorithmica

Author:

Fernandes Cristina G.^ORCID,Schouery Rafael C. S.^ORCID

Funder

Fundação de Amparo á Pesquisa do Estado de São Paulo

Conselho Nacional de Desenvolvimento Científico e Tecnológico

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,General Computer Science

Link

http://link.springer.com/article/10.1007/s00453-017-0364-7/fulltext.html

Reference22 articles.

1. Aggarwal, G., Feder, T., Motwani, R., Zhu, A.: Algorithms for multi-product pricing. In: Proceedings of the 31th International Colloquium on Automata, Languages and Programming, pp. 72–83 (2004)

2. Briest, P.: Uniform budgets and the envy-free pricing problem. In: Proceedings of the 35th International Colloquium on Automata, Languages and Programming, pp. 808–819 (2008)

3. Briest, P., Krysta, P.: Buying cheap is expensive: hardness of non-parametric multi-product pricing. In: Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 716–725 (2007)

4. Chalermsook, P., Chuzhoy, J., Kannan, S., Khanna, S.: Improved hardness results for profit maximization pricing problems with unlimited supply. In: Proceedings of the 15th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, pp. 73–84 (2012)

5. Chalermsook, P., Laekhanukit, B., Nanongkai, D.: Independent set, induced matching, and pricing: Connections and tight (subexponential time) approximation hardnesses. In: Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, pp. 370–379 (2013)