{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T07:42:29Z","timestamp":1794382949296,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642175718","type":"print"},{"value":"9783642175725","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17572-5_37","type":"book-chapter","created":{"date-parts":[[2010,12,6]],"date-time":"2010-12-06T03:54:45Z","timestamp":1291607685000},"page":"444-454","source":"Crossref","is-referenced-by-count":7,"title":["Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing"],"prefix":"10.1007","author":[{"given":"Patrick","family":"Briest","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Parinya","family":"Chalermsook","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sanjeev","family":"Khanna","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bundit","family":"Laekhanukit","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Danupon","family":"Nanongkai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"37_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-540-27836-8_9","volume-title":"Automata, Languages and Programming","author":"G. Aggarwal","year":"2004","unstructured":"Aggarwal, G., Feder, T., Motwani, R., Zhu, A.: Algorithms for multi-product pricing. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 72\u201383. Springer, Heidelberg (2004)"},{"key":"37_CR2","unstructured":"Arora, S., Lund, C.: Hardness Of Approximations. In: Approximation Algorithms for NP-hard Problems. PWS Publishing Company (1996)"},{"issue":"3","key":"37_CR3","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/278298.278306","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof Verification and Hardness of Approximation Problems. Journal of the ACM\u00a045(3), 501\u2013555 (1998)","journal-title":"Journal of the ACM"},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"Balcan, N., Blum, A., Mansour, Y.: Item Pricing for Revenue Maximization. In: Proc. of 9th EC (2008)","DOI":"10.1145\/1386790.1386802"},{"key":"37_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1007\/978-3-540-70575-8_66","volume-title":"Automata, Languages and Programming","author":"P. Briest","year":"2008","unstructured":"Briest, P.: Uniform Budgets and the Envy-Free Pricing Problem. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 808\u2013819. Springer, Heidelberg (2008)"},{"key":"37_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-642-10841-9_6","volume-title":"Internet and Network Economics","author":"P. Briest","year":"2009","unstructured":"Briest, P., Gual\u00e0, L., Hoefer, M., Ventre, C.: On Stackelberg Pricing with Computationally Bounded Consumers. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol.\u00a05929, pp. 42\u201354. Springer, Heidelberg (2009)"},{"key":"37_CR7","unstructured":"Briest, P., Hoefer, M., Krysta, P.: Stackelberg Network Pricing Games. In: Proc. of 25th STACS (2008)"},{"key":"37_CR8","unstructured":"Briest, P., Krysta, P.: Buying Cheap is Expensive: Hardness of Non-Parametric Multi-Product Pricing. In: Proc. of 18th SODA (2007)"},{"key":"37_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-540-73951-7_7","volume-title":"Algorithms and Data Structures","author":"J. Cardinal","year":"2007","unstructured":"Cardinal, J., Demaine, E., Fiorini, S., Joret, G., Langerman, S., Newman, I., Weimann, O.: The Stackelberg Minimum Spanning Tree Game. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol.\u00a04619, pp. 64\u201376. Springer, Heidelberg (2007)"},{"key":"37_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-642-10841-9_13","volume-title":"Internet and Network Economics","author":"J. Cardinal","year":"2009","unstructured":"Cardinal, J., Demaine, E., Fiorini, S., Joret, G., Newman, I., Weimann, O.: The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol.\u00a05929, pp. 125\u2013136. Springer, Heidelberg (2009)"},{"key":"37_CR11","unstructured":"Chuzhoy, J., Kannan, S., Khanna, S.: Network Pricing for Multicommodity Flows (2007) (unpublished manuscript)"},{"key":"37_CR12","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: Proc. of 17th SODA (2006)","DOI":"10.1145\/1109557.1109577"},{"key":"37_CR13","unstructured":"Guruswami, V., Hartline, J.D., Karlin, A.R., Kempe, D., Kenyon, C., McSherry, F.: On Profit-Maximizing Envy-Free Pricing. In: Proc. of 16th SODA (2005)"},{"key":"37_CR14","doi-asserted-by":"crossref","unstructured":"Joret, G.: Stackelberg Network Pricing is Hard to Approximate. Networks n\/a (2010), doi: 10.1002\/net.20391","DOI":"10.1002\/net.20391"},{"key":"37_CR15","doi-asserted-by":"crossref","unstructured":"Raz, R.: A Parallel Repetition Theorem. SIAM Journal on Computing\u00a027 (1998)","DOI":"10.1137\/S0097539795280895"},{"issue":"1","key":"37_CR16","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1002\/net.20074","volume":"46","author":"S. Roch","year":"2005","unstructured":"Roch, S., Savard, G., Marcotte, P.: An Approximation Algorithm for Stackelberg Network Pricing. Networks\u00a046(1), 57\u201367 (2005)","journal-title":"Networks"},{"key":"37_CR17","volume-title":"Marktform und Gleichgewicht (Market and Equilibrium)","author":"H. Stackelberg von","year":"1934","unstructured":"von Stackelberg, H.: Marktform und Gleichgewicht (Market and Equilibrium). Verlag von Julius Springer, Vienna (1934)"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17572-5_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,17]],"date-time":"2019-01-17T18:06:03Z","timestamp":1547748363000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17572-5_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175718","9783642175725"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17572-5_37","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-642-17572-5","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}