{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:32Z","timestamp":1740109292924,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2017,8,31]],"date-time":"2017-08-31T00:00:00Z","timestamp":1504137600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Funda\u00e7\u00e3o de Amparo \u00e1 Pesquisa do Estado de S\u00e3o Paulo","award":["2013\/03447-6"],"award-info":[{"award-number":["2013\/03447-6"]}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["308523\/2012-1"],"award-info":[{"award-number":["308523\/2012-1"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Funda\u00e7\u00e3o de Amparo \u00e1 Pesquisa do Estado de S\u00e3o Paulo","award":["2013\/21744-8"],"award-info":[{"award-number":["2013\/21744-8"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s00453-017-0364-7","type":"journal-article","created":{"date-parts":[[2017,8,31]],"date-time":"2017-08-31T10:30:23Z","timestamp":1504175423000},"page":"2973-2992","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximation Algorithms for the Max-Buying Problem with Limited Supply"],"prefix":"10.1007","volume":"80","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5259-2859","authenticated-orcid":false,"given":"Cristina G.","family":"Fernandes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0472-4810","authenticated-orcid":false,"given":"Rafael C. S.","family":"Schouery","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,31]]},"reference":[{"key":"364_CR1","doi-asserted-by":"crossref","unstructured":"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\u201383 (2004)","DOI":"10.1007\/978-3-540-27836-8_9"},{"key":"364_CR2","doi-asserted-by":"crossref","unstructured":"Briest, P.: Uniform budgets and the envy-free pricing problem. In: Proceedings of the 35th International Colloquium on Automata, Languages and Programming, pp. 808\u2013819 (2008)","DOI":"10.1007\/978-3-540-70575-8_66"},{"key":"364_CR3","unstructured":"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\u2013725 (2007)"},{"key":"364_CR4","doi-asserted-by":"crossref","unstructured":"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\u201384 (2012)","DOI":"10.1007\/978-3-642-32512-0_7"},{"key":"364_CR5","doi-asserted-by":"crossref","unstructured":"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\u2013379 (2013)","DOI":"10.1109\/FOCS.2013.47"},{"issue":"3","key":"364_CR6","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1016\/0097-3165(73)90005-8","volume":"14","author":"P Erd\u00f6s","year":"1973","unstructured":"Erd\u00f6s, P., Selfridge, J.L.: On a combinatorial game. J. Comb. Theory Ser. A 14(3), 298\u2013301 (1973)","journal-title":"J. Comb. Theory Ser. A"},{"key":"364_CR7","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/j.disopt.2015.09.003","volume":"22A","author":"CG Fernandes","year":"2016","unstructured":"Fernandes, C.G., Ferreira, C.E., Franco, A.J., Schouery, R.C.: The envy-free pricing problem, unit-demand markets and connections with the network pricing problem. Discret. Optim. 22A, 141\u2013161 (2016)","journal-title":"Discret. Optim."},{"key":"364_CR8","doi-asserted-by":"crossref","unstructured":"Fernandes, C.G., Schouery, R.C.S.: Approximation algorithms for the max-buying problem with limited supply. In: Proceedings of the 11th Latin American Theoretical INformatics Symposium, pp. 707\u2013718 (2014)","DOI":"10.1007\/978-3-642-54423-1_61"},{"key":"364_CR9","first-page":"317","volume":"13","author":"D Gale","year":"1951","unstructured":"Gale, D., Kuhn, H.W., Tucker, A.W.: Linear programming and the theory of games. Act. Anal. Prod. Alloc. 13, 317\u2013335 (1951)","journal-title":"Act. Anal. Prod. Alloc."},{"key":"364_CR10","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York, NY, USA (1979)"},{"key":"364_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, Berlin (1988)"},{"key":"364_CR12","unstructured":"Guruswami, V., Hartline, J.D., Karlin, A.R., Kempe, D., Kenyon, C., McSherry, F.: On profit-maximizing envy-free pricing. In: Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1164\u20131173 (2005)"},{"key":"364_CR13","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Khot, S.: Hardness of Max 3SAT with no mixed clauses. In: Proceedings of the 20th Annual IEEE Conference on Computational Complexity, pp. 154\u2013162 (2005)","DOI":"10.1109\/CCC.2005.10"},{"issue":"1\/2","key":"364_CR14","first-page":"110","volume":"9","author":"G Heilporn","year":"2009","unstructured":"Heilporn, G., Labb, M., Marcotte, P., Savard, G.: A parallel between two classes of pricing problems in transportation and marketing. Journal of Revenue and Pricing Management 9(1\/2), 110\u2013125 (2009)","journal-title":"Journal of Revenue and Pricing Management"},{"issue":"1","key":"364_CR15","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/BF01581035","volume":"22","author":"DS Hochbaum","year":"1982","unstructured":"Hochbaum, D.S.: Heuristics for the fixed cost median problem. Math. Program. 22(1), 148\u2013162 (1982)","journal-title":"Math. Program."},{"key":"364_CR16","doi-asserted-by":"crossref","unstructured":"Karmarkar, N., Karp, R.: An efficient approximation scheme for the one-dimensional bin-packing problem. In: Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, pp. 312\u2013320 (1982)","DOI":"10.1109\/SFCS.1982.61"},{"key":"364_CR17","first-page":"1093","volume":"244","author":"LG Khachiyan","year":"1979","unstructured":"Khachiyan, L.G.: A polynomial algorithm in linear programming. Doklady Akademii Nauk SSSR 244, 1093\u20131096 (1979)","journal-title":"Doklady Akademii Nauk SSSR"},{"issue":"1\u20132","key":"364_CR18","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Res. Logist. Quart. 2(1\u20132), 83\u201397 (1955)","journal-title":"Naval Res. Logist. Quart."},{"issue":"1","key":"364_CR19","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1137\/0105003","volume":"5","author":"J Munkres","year":"1957","unstructured":"Munkres, J.: Algorithms for the assignment and transportation problems. J. Soc. Ind. Appl. Math. 5(1), 32\u201338 (1957)","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"1","key":"364_CR20","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1287\/opre.1050.0252","volume":"54","author":"P Rusmevichientong","year":"2006","unstructured":"Rusmevichientong, P., Roy, B.V., Glynn, P.W.: A nonparametric approach to multiproduct pricing. Oper. Res. 54(1), 82\u201398 (2006)","journal-title":"Oper. Res."},{"key":"364_CR21","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency. Algorithms and combinatorics","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Algorithms and combinatorics. Springer, Berlin (2003)"},{"key":"364_CR22","volume-title":"Ten Lectures on the Probabilistic Method","author":"J Spencer","year":"1987","unstructured":"Spencer, J.: Ten Lectures on the Probabilistic Method. Society for Industrial and Applied Mathematics, Philadelphia (1987)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-017-0364-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0364-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0364-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,8,6]],"date-time":"2018-08-06T12:53:21Z","timestamp":1533560001000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-017-0364-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,31]]},"references-count":22,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["364"],"URL":"https:\/\/doi.org\/10.1007\/s00453-017-0364-7","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2017,8,31]]}}}