{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,6]],"date-time":"2024-07-06T23:32:04Z","timestamp":1720308724380},"reference-count":13,"publisher":"Wiley","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"tdm","delay-in-days":1890,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1.1"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"DOI":"10.1002\/net.20391","type":"journal-article","created":{"date-parts":[[2010,6,29]],"date-time":"2010-06-29T14:23:46Z","timestamp":1277821426000},"page":"n\/a-n\/a","source":"Crossref","is-referenced-by-count":2,"title":["Stackelberg network pricing is hard to approximate"],"prefix":"10.1002","author":[{"given":"Gwena\u00ebl","family":"Joret","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2010,6,29]]},"reference":[{"key":"10.1002\/net.20391-BIB1|cit1","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1002\/nav.20216","article-title":"Pricing bridges to cross a river","volume":"54","author":"Bouhtou","year":"2007","journal-title":"N R L"},{"key":"10.1002\/net.20391-BIB2|cit2","unstructured":"P. Briest M. Hoefer P. Krysta Stackelberg network pricing games 2008 133 142"},{"key":"10.1002\/net.20391-BIB3|cit3","doi-asserted-by":"crossref","unstructured":"J. Cardinal E.D. Demaine S. Fiorini G. Joret S. Langerman I. Newman O. Weimann The stackelberg minimum spanning tree game 2007 64 76","DOI":"10.1007\/978-3-540-73951-7_7"},{"key":"10.1002\/net.20391-BIB4|cit4","doi-asserted-by":"crossref","unstructured":"R. Cole Y. Dodis T. Roughgarden Pricing network edges for heterogeneous selfish users 2003 521 530","DOI":"10.1145\/780615.780618"},{"key":"10.1002\/net.20391-BIB5|cit5","doi-asserted-by":"crossref","first-page":"1464","DOI":"10.1137\/060656048","article-title":"Combination can be hard: Approximability of the unique coverage problem","volume":"38","author":"Demaine","year":"2008","journal-title":"SIAM J Comput"},{"key":"10.1002\/net.20391-BIB6|cit6","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/285055.285059","article-title":"A threshold of ln n for approximating set cover","volume":"45","author":"Feige","year":"1998","journal-title":"J ACM"},{"key":"10.1002\/net.20391-BIB7|cit7","unstructured":"V. Guruswami J. Hartline A. Karlin D. Kempe C. Kenyon F. McSherry On profit-maximizing envy-free pricing 2005 1164 1173"},{"key":"10.1002\/net.20391-BIB8|cit8","unstructured":"A. Hajnal E. Szemer\u00e9di Proof of a conjecture of P. Erd\u0151s 1970 601 623"},{"key":"10.1002\/net.20391-BIB9|cit9","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1017\/S0963548307008619","article-title":"A short proof of the Hajnal-Szemer\u00e9di theorem on equitable colouring","volume":"17","author":"Kierstead","year":"2008","journal-title":"Combin Probab Comput"},{"key":"10.1002\/net.20391-BIB10|cit10","doi-asserted-by":"crossref","first-page":"1608","DOI":"10.1287\/mnsc.44.12.1608","article-title":"A bilevel model of taxation and its application to optimal highway pricing","volume":"44","author":"Labb\u00e9","year":"1998","journal-title":"Manag Sci"},{"key":"10.1002\/net.20391-BIB11|cit11","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1002\/net.20074","article-title":"An approximation algorithm for Stackelberg network pricing","volume":"46","author":"Roch","year":"2005","journal-title":"Networks"},{"key":"10.1002\/net.20391-BIB12|cit12","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1137\/S0097539701397059","article-title":"Stackelberg scheduling strategies","volume":"33","author":"Roughgarden","year":"2004","journal-title":"SIAM J Comput"},{"key":"10.1002\/net.20391-BIB13|cit13","unstructured":"C. Swamy The effectiveness of stackelberg strategies and tolls for network congestion games 2007 1133 1142"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.20391","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full\/10.1002\/net.20391","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,5]],"date-time":"2021-07-05T04:12:04Z","timestamp":1625458324000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.20391"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,29]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1002\/net.20391","relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,6,29]]}}}