{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:40:34Z","timestamp":1725532834102},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642020100"},{"type":"electronic","value":"9783642020117"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02011-7_17","type":"book-chapter","created":{"date-parts":[[2009,6,2]],"date-time":"2009-06-02T09:12:20Z","timestamp":1243933940000},"page":"173-184","source":"Crossref","is-referenced-by-count":0,"title":["Speed-Up Techniques for the Selfish Step Algorithm in Network Congestion Games"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Kirschner","sequence":"first","affiliation":[]},{"given":"Philipp","family":"Schengbier","sequence":"additional","affiliation":[]},{"given":"Tobias","family":"Tscheuschner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Ackermann, H., R\u00f6glin, H., V\u00f6cking, B.: On the impact of combinatorial structure on congestion games. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 613\u2013622 (2006)","DOI":"10.1109\/FOCS.2006.55"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Bast, H., Funke, S., Matijevic, D., Sanders, P., Schultes, D.: In transit to constant time shortest path queries in road networks. In: Proceedings of the 6th Workshop on Algorithms and Experiments (ALENEX), pp. 46\u201359 (2007)","DOI":"10.1137\/1.9781611972870.5"},{"issue":"5824","key":"17_CR3","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1126\/science.1137521","volume":"316","author":"H. Bast","year":"2007","unstructured":"Bast, H., Funke, S., Sanders, P., Schultes, D.: Fast routing in road networks with transit nodes. Science\u00a0316(5824), 566 (2007)","journal-title":"Science"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-540-72845-0_5","volume-title":"Experimental Algorithms","author":"D. Delling","year":"2007","unstructured":"Delling, D., Wagner, D.: Landmark-Based Routing in Dynamic Graphs. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol.\u00a04525, pp. 52\u201365. Springer, Heidelberg (2007)"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C.H., Talwar, K.: The complexity of pure Nash Equilibria. In: Proceedings of the 36th ACM Symposium on Theory of Computing (STOC), pp. 604\u2013612 (2004)","DOI":"10.1145\/1007352.1007445"},{"key":"17_CR6","first-page":"100","volume-title":"Proceedings of the 6th International Workshop on Algorithm Engineering and Experiments","author":"R. Gutman","year":"2004","unstructured":"Gutman, R.: Reach Based Routing: A New Approach to Shortest Path Algorithms Optimized for Road Networks. In: Proceedings of the 6th International Workshop on Algorithm Engineering and Experiments, pp. 100\u2013111. SIAM, Philadelphia (2004)"},{"issue":"2","key":"17_CR7","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"P.E. Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A Formal Basis for the Heuristic Determination Of Minimum Cost Paths. IEEE Transactions on Systems Science and Cybernetics\u00a04(2), 100\u2013107 (1968)","journal-title":"IEEE Transactions on Systems Science and Cybernetics"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Panagopoulou, P.N., Spirakis, P.G.: Algorithms for pure Nash equilibria in weighted congestion games. Journal of Experimental Algorithmics\u00a0(11) (2006)","DOI":"10.1145\/1187436.1216584"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"R.W. Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory\u00a02, 65\u201367 (1973)","journal-title":"International Journal of Game Theory"},{"issue":"2","key":"17_CR10","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1287\/trsc.24.2.153","volume":"24","author":"H. Spiess","year":"1990","unstructured":"Spiess, H.: Conical volume-delay functions. Transportation Science\u00a024(2), 153\u2013158 (1990)","journal-title":"Transportation Science"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-540-72845-0_2","volume-title":"Experimental Algorithms","author":"P. Sanders","year":"2007","unstructured":"Sanders, P., Schultes, D.: Engineering fast route planning algorithms. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol.\u00a04525, pp. 23\u201336. Springer, Heidelberg (2007)"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1007\/11561071_51","volume-title":"Algorithms \u2013 ESA 2005","author":"P. Sanders","year":"2005","unstructured":"Sanders, P., Schultes, D.: Highway hierarchies hasten exact shortest path queries. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 568\u2013579. Springer, Heidelberg (2005)"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1007\/11841036_71","volume-title":"Algorithms \u2013 ESA 2006","author":"P. Sanders","year":"2006","unstructured":"Sanders, P., Schultes, D.: Engineering highway hierarchies. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol.\u00a04168, pp. 804\u2013816. Springer, Heidelberg (2006)"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-540-72845-0_6","volume-title":"Experimental Algorithms","author":"D. Schultes","year":"2007","unstructured":"Schultes, D., Sanders, P.: Dynamic highway-node routing. In: Demetrescu, C. (ed.) WEA 2007. LNCS, vol.\u00a04525, pp. 66\u201379. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02011-7_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T14:55:26Z","timestamp":1558364126000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02011-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642020100","9783642020117"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02011-7_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}