{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:51:02Z","timestamp":1725565862126},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228493"},{"type":"electronic","value":"9783540278368"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27836-8_47","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T22:53:21Z","timestamp":1284591201000},"page":"544-554","source":"Crossref","is-referenced-by-count":7,"title":["Linear Tolls Suffice: New Bounds and Algorithms for Tolls in Single Source Networks"],"prefix":"10.1007","author":[{"given":"Lisa","family":"Fleischer","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"47_CR1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs (1993)"},{"key":"47_CR2","volume-title":"Studies in the Economics of Transportation","author":"M. Beckman","year":"1956","unstructured":"Beckman, M., McGuire, C.B., Winsten, C.B.: Studies in the Economics of Transportation. Yale University Press, New Haven (1956)"},{"key":"47_CR3","doi-asserted-by":"crossref","unstructured":"Border, K.C.: Fixed Point Theorems with Applications to Economics and Game Theory, Cambridge (1985)","DOI":"10.1017\/CBO9780511625756"},{"key":"47_CR4","unstructured":"Carstensen, P.J.: Parametric cost shortest path problems. Unpoblished Bellcore memo (1984)"},{"key":"47_CR5","doi-asserted-by":"crossref","unstructured":"Cole, R., Dodis, Y., Roughgarden, T.: Pricing network edges for heterogeneous selfish users. In: Proc. 35th Annual ACM Symposium on the Theory of Computing (2003)","DOI":"10.1145\/780542.780618"},{"key":"47_CR6","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1287\/trsc.7.3.211","volume":"7","author":"S.C. Dafermos","year":"1973","unstructured":"Dafermos, S.C.: Toll patterns for multiclass-user transportation networks. Transportation Sci.\u00a07, 211\u2013223 (1973)","journal-title":"Transportation Sci."},{"key":"47_CR7","unstructured":"Fleischer, L., Jain, K., Mahdian, M.: Taxes for heterogeneous selfish users in a multicommodity network (April 2004) (submitted)"},{"key":"47_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/3-540-49116-3_38","volume-title":"STACS 99","author":"E. Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol.\u00a01563, pp. 404\u2013413. Springer, Heidelberg (1999)"},{"key":"47_CR9","volume-title":"The Economics of Welfare","author":"A.C. Pigou","year":"1920","unstructured":"Pigou, A.C.: The Economics of Welfare. Macmillan, Basingstoke (1920)"},{"key":"47_CR10","doi-asserted-by":"crossref","unstructured":"Roughgarden, T., Tardos, E.: How bad is selfish routing? In: IEEE Symposium on Foundations of Computer Science, pp. 93\u2013102 (2000)","DOI":"10.1109\/SFCS.2000.892069"},{"key":"47_CR11","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0191-2615(79)90015-8","volume":"13","author":"M.J. Smith","year":"1979","unstructured":"Smith, M.J.: The marginal cost taxation of a transportation network. Trans. Res. Ser. B\u00a013, 237\u2013242 (1979)","journal-title":"Trans. Res. Ser. B"},{"key":"47_CR12","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1680\/ipeds.1952.11259","volume":"1","author":"J.G. Wardrop","year":"1952","unstructured":"Wardrop, J.G.: Some theoretical aspects of rad traffic research. Proc. Institute of Civil Engineers, Pt. II\u00a01, 325\u2013378 (1952)","journal-title":"Proc. Institute of Civil Engineers, Pt. II"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27836-8_47.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:30:59Z","timestamp":1620012659000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27836-8_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228493","9783540278368"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27836-8_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}