{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:12:15Z","timestamp":1725541935830},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642112652"},{"type":"electronic","value":"9783642112669"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11266-9_39","type":"book-chapter","created":{"date-parts":[[2009,12,7]],"date-time":"2009-12-07T14:04:58Z","timestamp":1260194698000},"page":"465-476","source":"Crossref","is-referenced-by-count":1,"title":["On the Complexity of the Highway Pricing Problem"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Grigoriev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joyce","family":"van Loon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Uetz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"39_CR1","first-page":"29","volume-title":"Proceedings of the 7th\u00a0ACM Conference on Electronic Commerce","author":"M.F. Balcan","year":"2006","unstructured":"Balcan, M.F., Blum, A.: Approximation Algorithms and Online Mechanisms for Item Pricing. In: Proceedings of the 7th\u00a0ACM Conference on Electronic Commerce, pp. 29\u201335. ACM, New York (2006)"},{"key":"39_CR2","doi-asserted-by":"crossref","unstructured":"Briest, P., Krysta, P.: Single-Minded Unlimited Supply Pricing on Sparse Instances. In: Proceedings of the 17th\u00a0Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1093\u20131102. ACM-SIAM (2006)","DOI":"10.1145\/1109557.1109678"},{"key":"39_CR3","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Feige, U., Hajiaghayi, M.T., Salavatipour, M.R.: Combination Can Be Hard: Approximability of the Unique Coverage Problem. In: Proceedings of the 17th\u00a0Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 162\u2013171. ACM-SIAM (2006)","DOI":"10.1145\/1109557.1109577"},{"key":"39_CR4","doi-asserted-by":"crossref","unstructured":"Elbassioni, K., Raman, R., Ray, S., Sitters, R.: On Profit-Maximizing Pricing for the Highway and Tollbooth Problems. Retrieved from arXiv:0901.1140v3 (June 2009)","DOI":"10.1007\/978-3-642-04645-2_25"},{"key":"39_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-540-75520-3_41","volume-title":"Algorithms \u2013 ESA 2007","author":"K. Elbassioni","year":"2007","unstructured":"Elbassioni, K., Sitters, R., Zhang, Y.: A Quasi-PTAS for Profit-Maximizing Pricing on Line Graphs. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol.\u00a04698, pp. 451\u2013462. Springer, Heidelberg (2007)"},{"key":"39_CR6","volume-title":"Computers and Intractability: a Quide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: a Quide to the Theory of NP-Completeness. W.H.\u00a0Freeman, New York (1979)"},{"issue":"1","key":"39_CR7","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1002\/net.20260","volume":"53","author":"A. Grigoriev","year":"2009","unstructured":"Grigoriev, A., van Loon, J., Sitters, R., Uetz, M.: Optimal Pricing of Capacitated Networks. Networks\u00a053(1), 79\u201387 (2009)","journal-title":"Networks"},{"key":"39_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/978-3-540-75520-3_43","volume-title":"Algorithms \u2013 ESA 2007","author":"A. Grigoriev","year":"2007","unstructured":"Grigoriev, A., van Loon, J., Sviridenko, M., Uetz, M., Vredeveld, T.: Bundle Pricing with Comparable Items. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol.\u00a04698, pp. 475\u2013486. Springer, Heidelberg (2007)"},{"key":"39_CR9","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\u00a0Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1164\u20131173. ACM-SIAM (2005)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2010: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11266-9_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T08:44:55Z","timestamp":1558687495000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11266-9_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642112652","9783642112669"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11266-9_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}