{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:18:30Z","timestamp":1761895110505},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540245742"},{"type":"electronic","value":"9783540318330"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31833-0_13","type":"book-chapter","created":{"date-parts":[[2010,7,2]],"date-time":"2010-07-02T18:11:05Z","timestamp":1278094265000},"page":"140-153","source":"Crossref","is-referenced-by-count":14,"title":["Pricing Network Edges to Cross a River"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Grigoriev","sequence":"first","affiliation":[]},{"given":"Stan","family":"van Hoesel","sequence":"additional","affiliation":[]},{"given":"Anton F.","family":"van der Kraaij","sequence":"additional","affiliation":[]},{"given":"Marc","family":"Uetz","sequence":"additional","affiliation":[]},{"given":"Mustapha","family":"Bouhtou","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","unstructured":"Bouhtou, M., van Hoesel, S., van der Kraaij, A.F., Lutton, J.L.: Tariff optimization in networks. Meteor Research Memorandum RM03011, Maastricht University (2003)"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Cole, R., Dodis, Y., Roughgarden, T.: How much can taxes help selfish routing? In: Proceedings of the 4th Annual ACM Conference on Electronic commerce, pp. 98\u2013107 (2003)","DOI":"10.1145\/779928.779941"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Cole, R., Dodis, Y., Roughgarden, T.: Pricing network edges for heterogeneous selfish users. In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, pp. 521\u2013530 (2003)","DOI":"10.1145\/780542.780618"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1080\/0233193031000149894","volume":"52","author":"S. Dempe","year":"2003","unstructured":"Dempe, S.: Annotated bibliography on bilevel programming and mathematical programs with equilibrium constraints. Optimization\u00a052, 333\u2013359 (2003)","journal-title":"Optimization"},{"key":"13_CR5","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco (1979)"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02392825","volume":"182","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J.: Clique is hard to approximate within n\n                           1\u2009\u2212\u2009\u03b5\n                           . Acta Mathematica\u00a0182, 105\u2013142 (1999)","journal-title":"Acta Mathematica"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/BF01586088","volume":"32","author":"R.G. Jeroslow","year":"1985","unstructured":"Jeroslow, R.G.: The polynomial hierarchy and a simple model for competitive analysis. Mathematical Programming\u00a032, 146\u2013164 (1985)","journal-title":"Mathematical Programming"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0166-218X(81)90026-3","volume":"3","author":"R.M. Karp","year":"1981","unstructured":"Karp, R.M., Orlin, J.B.: Parametric shortest path algorithms with an application to cyclic staffing. Discrete Applied Mathematics\u00a03, 37\u201345 (1981)","journal-title":"Discrete Applied Mathematics"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"1608","DOI":"10.1287\/mnsc.44.12.1608","volume":"44","author":"M. Labb\u00e9","year":"1998","unstructured":"Labb\u00e9, M., Marcotte, P., Savard, G.: A bilevel model of taxation and its application to optimal highway pricing. Management Science\u00a044, 1608\u20131622 (1998)","journal-title":"Management Science"},{"key":"13_CR10","unstructured":"Roch, S., Savard, G., Marcotte, P.: Design and Analysis of an approximation algorithm for Stackelberg network pricing. Optimization Online (2003)"},{"issue":"2","key":"13_CR11","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T. Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, \u00c9.: How bad is selfish routing? Journal of the Association for Computing Machinery\u00a049(2), 236\u2013259 (2002)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"13_CR12","unstructured":"van Hoesel, S., van der Kraaij, A.F., Mannino, C., Oriolo, G., Bouhtou, M.: Polynomial cases of the tarification problem. Meteor Resarch Memorandum RM03053, Maastricht University (2003)"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/BF01096458","volume":"5","author":"L.N. Vicente","year":"1994","unstructured":"Vicente, L.N., Calamai, P.H.: Bilevel and multilevel programming: A bibliography review. Journal of Global Optimization\u00a05, 291\u2013306 (1994)","journal-title":"Journal of Global Optimization"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1002\/net.3230210206","volume":"21","author":"N.E. Young","year":"1991","unstructured":"Young, N.E., Tarjan, R.E., Orlin, J.B.: Faster parametric shortest path and minimum-balance algorithms. Networks\u00a021, 205\u2013221 (1991)","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31833-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T08:54:08Z","timestamp":1552640048000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31833-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540245742","9783540318330"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31833-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}