{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T04:27:19Z","timestamp":1743740839756,"version":"3.40.3"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,7,1]],"date-time":"2012-07-01T00:00:00Z","timestamp":1341100800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1007\/s11390-012-1258-4","type":"journal-article","created":{"date-parts":[[2012,7,13]],"date-time":"2012-07-13T08:31:36Z","timestamp":1342168296000},"page":"718-726","source":"Crossref","is-referenced-by-count":0,"title":["Pricing Loss Leaders Can be Hard"],"prefix":"10.1007","volume":"27","author":[{"given":"Yi","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,7,12]]},"reference":[{"key":"1258_CR1","unstructured":"Guruswami V, Hartline J D, Karlin A R, Kempe D, Kenyon C, McSherry F. On profit-maximizing envy-free pricing. In Proc. the 15th ACM-SIAM Symp. Discrete Algorithms, Philadelphia, PA, USA, Jan. 2005, pp.1164\u20131173."},{"key":"1258_CR2","doi-asserted-by":"crossref","unstructured":"Briest P, Krysta P. Single-minded unlimited supply pricing on sparse instances. In Proc. the 17th ACM-SIAM Symp. Discrete Algorithms, New York, USA, Jan. 2006, pp.1093\u20131102.","DOI":"10.1145\/1109557.1109678"},{"key":"1258_CR3","doi-asserted-by":"crossref","unstructured":"Balcan M\u00a0F, Blum A. Approximation algorithms and online mechanisms for item pricing. In Proc. the 7th ACM Conference on Electronic Commerce, New York, USA, June 2006, pp.29\u201335.","DOI":"10.1145\/1134707.1134711"},{"key":"1258_CR4","doi-asserted-by":"crossref","unstructured":"Demaine E K, Feige U, Hajiaghayi M, Salavatipour M R. Combination can be hard: Approximability of the unique coverage problem. In Proc. the 17th ACM-SIAM Symp. Discrete Algorithms, New York, USA, Jan. 2006, pp.162\u2013171.","DOI":"10.1145\/1109557.1109577"},{"key":"1258_CR5","doi-asserted-by":"crossref","unstructured":"Khandekar R, Kimbrel T, Makarychev K, Sviridenko M. On hardness of pricing items for single-minded bidders. In APPROX-RANDOM, Berkeley, USA, August 2009, pp.202\u2013216.","DOI":"10.1007\/978-3-642-03685-9_16"},{"key":"1258_CR6","doi-asserted-by":"crossref","unstructured":"Khot S. On the power of unique 2-prover 1-round games. In Proc. the 34th STOC, Montreal, Canada, May 2002, pp.767\u2013775.","DOI":"10.1145\/509907.510017"},{"key":"1258_CR7","doi-asserted-by":"crossref","unstructured":"Balcan M\u00a0F, Blum A, Chan H, Hajiaghayi M. A theory of lossleaders: Making money by pricing below cost. In Proc. the 3rd Intern. Workshop on Internet and Network Economics, San Diego, USA, Dec. 2007, pp.293\u2013299.","DOI":"10.1007\/978-3-540-77105-0_29"},{"issue":"1","key":"1258_CR8","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1137\/S0097539705447372","volume":"37","author":"S Khot","year":"2007","unstructured":"Khot S, Kindler G, Mossel E, O\u2019Donnell R. Optimal inapproximability results for MAX-CUT and other 2-variable CSPs? SIAM Journal on Computing, 2007, 37(1): 319\u2013357.","journal-title":"SIAM Journal on Computing"},{"key":"1258_CR9","unstructured":"Raghavendra P. Approximating NP-hard problems: Efficient algorithms and their limits [PhD Thesis]. University of Washington, 2009."},{"key":"1258_CR10","doi-asserted-by":"crossref","unstructured":"Mossel E. Gaussian bounds for noise correlation of functions and tight analysis of long codes. In Proc. the 49th IEEE Symp. Foundations of Comp. Sci., Philadelphia, USA, Oct. 2008, pp.156\u2013165.","DOI":"10.1109\/FOCS.2008.44"},{"key":"1258_CR11","doi-asserted-by":"crossref","unstructured":"O\u2019Donnell R, Wu Y, Zhou Y. Hardness of Max-2Lin and Max-3Lin over integers, reals, and large cyclic groups. In Proc. the 26th IEEE Conference on Computational Complexity, San Jose, USA, June 2011, pp.23\u201333.","DOI":"10.1109\/CCC.2011.37"},{"key":"1258_CR12","doi-asserted-by":"crossref","unstructured":"Khot S, Regev O. Vertex cover might be hard to approximate to within 2\u2009\u2212\u2009\u03f5. In Proc. the 18th IEEE Conference on Computational Complexity, Aarhus, Denmark, July 2003, pp.379\u2013386.","DOI":"10.1109\/CCC.2003.1214437"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-012-1258-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-012-1258-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-012-1258-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T23:31:18Z","timestamp":1743723078000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-012-1258-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["1258"],"URL":"https:\/\/doi.org\/10.1007\/s11390-012-1258-4","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"type":"print","value":"1000-9000"},{"type":"electronic","value":"1860-4749"}],"subject":[],"published":{"date-parts":[[2012,7]]}}}