{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T00:10:28Z","timestamp":1773792628455,"version":"3.50.1"},"reference-count":61,"publisher":"Association for Computing Machinery (ACM)","license":[{"start":{"date-parts":[[2019,12,10]],"date-time":"2019-12-10T00:00:00Z","timestamp":1575936000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ACM J. Exp. Algorithmics"],"published-print":{"date-parts":[[2019,12,17]]},"abstract":"<jats:p>Given an urban road network and a set of origin-destination pairs, the traffic assignment problem asks for the traffic flow on each road segment. Common solution algorithms require a large number of shortest-path computations. In this article, we significantly accelerate the computation of flow patterns, enabling interactive transportation and urban planning applications. We achieve this by building a traffic assignment procedure upon customizable contraction hierarchies (CCH), revisiting and carefully engineering CCH customization and queries, and adapting CCH to compute batched point-to-point shortest paths. Although motivated by the traffic assignment problem, our optimizations apply to CCH in general. In contrast to previous work, our evaluation uses real-world production data for all parts of the input. On a metropolitan area encompassing about 2.7\u00a0million inhabitants, we decrease the flow-pattern computation for a typical 1-hour morning peak (a quarter million trips) from 90.9 to 14.1\u00a0seconds on one core and 2.4\u00a0seconds on a 16-core machine. This represents a speedup of 37 over the state of the art and more than three orders of magnitude over the Dijkstra-based baseline.<\/jats:p>","DOI":"10.1145\/3362693","type":"journal-article","created":{"date-parts":[[2019,12,10]],"date-time":"2019-12-10T13:21:36Z","timestamp":1575984096000},"page":"1-28","source":"Crossref","is-referenced-by-count":24,"title":["Real-time Traffic Assignment Using Engineered Customizable Contraction Hierarchies"],"prefix":"10.1145","volume":"24","author":[{"given":"Valentin","family":"Buchhold","sequence":"first","affiliation":[{"name":"Karlsruhe Institute of Technology, Karlsruhe, Germany"}]},{"given":"Peter","family":"Sanders","sequence":"additional","affiliation":[{"name":"Karlsruhe Institute of Technology, Karlsruhe, Germany"}]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[{"name":"Karlsruhe Institute of Technology, Karlsruhe, Germany"}]}],"member":"320","published-online":{"date-parts":[[2019,12,10]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Proceedings of the 10th International Symposium on Experimental Algorithms (SEA\u201911)","volume":"6630","author":"Abraham Ittai","year":"2066","unstructured":"Ittai Abraham , Daniel Delling , Andrew V. Goldberg , and Renato F. Werneck . 2011. A hub-based labeling algorithm for shortest paths in road networks . In Proceedings of the 10th International Symposium on Experimental Algorithms (SEA\u201911) (Lecture Notes in Computer Science), Panos M. Pardalos and Steffen Rebennack (Eds.) , Vol. 6630 . Springer, 230--241. DOI:https:\/\/doi.org\/10.1007\/978-3-642- 2066 2-7_20 10.1007\/978-3-642-20662-7_20 Ittai Abraham, Daniel Delling, Andrew V. Goldberg, and Renato F. Werneck. 2011. A hub-based labeling algorithm for shortest paths in road networks. In Proceedings of the 10th International Symposium on Experimental Algorithms (SEA\u201911) (Lecture Notes in Computer Science), Panos M. Pardalos and Steffen Rebennack (Eds.), Vol. 6630. Springer, 230--241. DOI:https:\/\/doi.org\/10.1007\/978-3-642-20662-7_20"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38527-8_7"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2009.11.004"},{"key":"e_1_2_1_5_1","volume-title":"Werneck","author":"Bast Hannah","year":"2016","unstructured":"Hannah Bast , Daniel Delling , Andrew V. Goldberg , Matthias M\u00fcller-Hannemann , Thomas Pajor , Peter Sanders , Dorothea Wagner , and Renato F . Werneck . 2016 . Route planning in transportation networks. In Algorithm Engineering: Selected Results and Surveys, Lasse Kliemann and Peter Sanders (Eds.). Lecture Notes in Computer Science, Vol. 9220 . Springer , 19--80. DOI:https:\/\/doi.org\/10.1007\/978-3-319-49487-6_2 10.1007\/978-3-319-49487-6_2 Hannah Bast, Daniel Delling, Andrew V. Goldberg, Matthias M\u00fcller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, and Renato F. Werneck. 2016. Route planning in transportation networks. In Algorithm Engineering: Selected Results and Surveys, Lasse Kliemann and Peter Sanders (Eds.). Lecture Notes in Computer Science, Vol. 9220. Springer, 19--80. DOI:https:\/\/doi.org\/10.1007\/978-3-319-49487-6_2"},{"key":"e_1_2_1_6_1","volume-title":"Fast routing in road networks with transit nodes. Science 316, 5824","author":"Bast Holger","year":"2007","unstructured":"Holger Bast , Stefan Funke , Peter Sanders , and Dominik Schultes . 2007. Fast routing in road networks with transit nodes. Science 316, 5824 ( 2007 ), 566. DOI:https:\/\/doi.org\/10.1126\/science.1137521 10.1126\/science.1137521 Holger Bast, Stefan Funke, Peter Sanders, and Dominik Schultes. 2007. Fast routing in road networks with transit nodes. Science 316, 5824 (2007), 566. DOI:https:\/\/doi.org\/10.1126\/science.1137521"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.07.003"},{"key":"e_1_2_1_8_1","first-page":"2","article-title":"SHARC: Fast and robust unidirectional routing","volume":"14","author":"Bauer Reinhard","year":"2009","unstructured":"Reinhard Bauer and Daniel Delling . 2009 . SHARC: Fast and robust unidirectional routing . ACM J. Exper. Algor. 14 (2009), 2 .4:1--2.4:29. DOI:https:\/\/doi.org\/10.1145\/1498698.1537599 10.1145\/1498698.1537599 Reinhard Bauer and Daniel Delling. 2009. SHARC: Fast and robust unidirectional routing. ACM J. Exper. Algor. 14 (2009), 2.4:1--2.4:29. DOI:https:\/\/doi.org\/10.1145\/1498698.1537599","journal-title":"ACM J. Exper. Algor."},{"key":"e_1_2_1_9_1","volume-title":"Winsten","author":"Beckmann Martin","year":"1956","unstructured":"Martin Beckmann , C. Bart McGuire , and Christopher B . Winsten . 1956 . Studies in the Economics of Transportation. Yale University Press . Martin Beckmann, C. Bart McGuire, and Christopher B. Winsten. 1956. Studies in the Economics of Transportation. Yale University Press."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73951-7_13"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1061\/(ASCE)0733-947X(2004)130:1(49)"},{"key":"e_1_2_1_12_1","volume-title":"Proceedings of the 17th International Symposium on Experimental Algorithms (SEA\u201918) (Leibniz International Proceedings in Informatics (LIPIcs)), Gianlorenzo D\u2019Angelo (Ed.)","volume":"103","author":"Buchhold Valentin","year":"2018","unstructured":"Valentin Buchhold , Peter Sanders , and Dorothea Wagner . 2018 . Real-time traffic assignment using fast queries in customizable contraction hierarchies . In Proceedings of the 17th International Symposium on Experimental Algorithms (SEA\u201918) (Leibniz International Proceedings in Informatics (LIPIcs)), Gianlorenzo D\u2019Angelo (Ed.) , Vol. 103 . Schloss Dagstuhl, 27:1--27:15. DOI:https:\/\/doi.org\/10.4230\/LIPIcs.SEA. 2018.27 10.4230\/LIPIcs.SEA.2018.27 Valentin Buchhold, Peter Sanders, and Dorothea Wagner. 2018. Real-time traffic assignment using fast queries in customizable contraction hierarchies. In Proceedings of the 17th International Symposium on Experimental Algorithms (SEA\u201918) (Leibniz International Proceedings in Informatics (LIPIcs)), Gianlorenzo D\u2019Angelo (Ed.), Vol. 103. Schloss Dagstuhl, 27:1--27:15. DOI:https:\/\/doi.org\/10.4230\/LIPIcs.SEA.2018.27"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3347146.3359361"},{"key":"e_1_2_1_14_1","unstructured":"Bureau of Public Roads. 1964. Traffic Assignment Manual. U.S. Department of Commerce.  Bureau of Public Roads. 1964. Traffic Assignment Manual. U.S. Department of Commerce."},{"key":"e_1_2_1_16_1","volume-title":"Proceedings of the 17th International Symposium on Experimental Algorithms (SEA\u201918). Leibniz International Proceedings in Informatics (LIPIcs)","volume":"103","author":"Ed Gianlorenzo","year":"2018","unstructured":"Gianlorenzo D\u2019Angelo ( Ed .). 2018 . Proceedings of the 17th International Symposium on Experimental Algorithms (SEA\u201918). Leibniz International Proceedings in Informatics (LIPIcs) , Vol. 103 . Schloss Dagstuhl. Gianlorenzo D\u2019Angelo (Ed.). 2018. Proceedings of the 17th International Symposium on Experimental Algorithms (SEA\u201918). Leibniz International Proceedings in Informatics (LIPIcs), Vol. 103. Schloss Dagstuhl."},{"key":"e_1_2_1_17_1","volume-title":"Proceedings of the 3rd Australian Road Research Board Conference (ARRB\u201966)","author":"Davidson K. B.","year":"1966","unstructured":"K. B. Davidson . 1966 . A flow travel time relationship for use in transportation planning . In Proceedings of the 3rd Australian Road Research Board Conference (ARRB\u201966) . K. B. Davidson. 1966. A flow travel time relationship for use in transportation planning. In Proceedings of the 3rd Australian Road Research Board Conference (ARRB\u201966)."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2012.02.007"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2014.0579"},{"key":"e_1_2_1_20_1","volume-title":"Proceedings of the 11th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS\u201911)","volume":"20","author":"Delling Daniel","year":"2011","unstructured":"Daniel Delling , Andrew V. Goldberg , and Renato F. Werneck . 2011. Faster batched shortest paths in road networks . In Proceedings of the 11th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS\u201911) (OpenAccess Series in Informatics (OASIcs)), Alberto Caprara and Spyros C. Kontogiannis (Eds.) , Vol. 20 . Schloss Dagstuhl, 52--63. DOI:https:\/\/doi.org\/10.4230\/OASIcs.ATMOS. 2011 .52 10.4230\/OASIcs.ATMOS.2011.52 Daniel Delling, Andrew V. Goldberg, and Renato F. Werneck. 2011. Faster batched shortest paths in road networks. In Proceedings of the 11th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS\u201911) (OpenAccess Series in Informatics (OASIcs)), Alberto Caprara and Spyros C. Kontogiannis (Eds.), Vol. 20. Schloss Dagstuhl, 52--63. DOI:https:\/\/doi.org\/10.4230\/OASIcs.ATMOS.2011.52"},{"key":"e_1_2_1_21_1","volume-title":"Werneck","author":"Delling Daniel","year":"2013","unstructured":"Daniel Delling and Renato F . Werneck . 2013 . Faster customization of road networks. In Proceedings of the 12th International Symposium on Experimental Algorithms (SEA\u201913) (Lecture Notes in Computer Science), Vincenzo Bonifaci, Camil Demetrescu, and Alberto Marchetti-Spaccamela (Eds.), Vol. 7933 . Springer , 30--42. DOI:https:\/\/doi.org\/10.1007\/978-3-642-38527-8_5 10.1007\/978-3-642-38527-8_5 Daniel Delling and Renato F. Werneck. 2013. Faster customization of road networks. In Proceedings of the 12th International Symposium on Experimental Algorithms (SEA\u201913) (Lecture Notes in Computer Science), Vincenzo Bonifaci, Camil Demetrescu, and Alberto Marchetti-Spaccamela (Eds.), Vol. 7933. Springer, 30--42. DOI:https:\/\/doi.org\/10.1007\/978-3-642-38527-8_5"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2345386"},{"key":"e_1_2_1_23_1","volume-title":"The Shortest Path Problem: Ninth DIMACS Implementation Challenge. DIMACS Book","volume":"74","author":"Demetrescu Camil","unstructured":"Camil Demetrescu , Andrew V. Goldberg , and David S . Johnson (Eds.). 2009 . The Shortest Path Problem: Ninth DIMACS Implementation Challenge. DIMACS Book , Vol. 74 . American Mathematical Society. Camil Demetrescu, Andrew V. Goldberg, and David S. Johnson (Eds.). 2009. The Shortest Path Problem: Ninth DIMACS Implementation Challenge. DIMACS Book, Vol. 74. American Mathematical Society."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2006.02.008"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2886843"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2533828.2533838"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44777-2_30"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-20086-6_23"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.3141\/2090-02"},{"key":"e_1_2_1_31_1","volume-title":"Hearn","author":"Florian Michael","year":"1995","unstructured":"Michael Florian and Donald W . Hearn . 1995 . Network equilibrium models and algorithms. In Network Routing, Michael O. Ball, Tom L. Magnanti, Clyde L. Monma, and George L. Nemhauser (Eds.). Handbooks in Operations Research and Management Science, Vol. 8 . Elsevier , 485--550. DOI:https:\/\/doi.org\/10.1016\/S0927-0507(05)80110-0 10.1016\/S0927-0507(05)80110-0 Michael Florian and Donald W. Hearn. 1995. Network equilibrium models and algorithms. In Network Routing, Michael O. Ball, Tom L. Magnanti, Clyde L. Monma, and George L. Nemhauser (Eds.). Handbooks in Operations Research and Management Science, Vol. 8. Elsevier, 485--550. DOI:https:\/\/doi.org\/10.1016\/S0927-0507(05)80110-0"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800030109"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1110.0401"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1080\/18128602.2012.691911"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/0710032"},{"key":"e_1_2_1_36_1","first-page":"1","article-title":"Graph bisection with Pareto optimization","volume":"23","author":"Hamann Michael","year":"2018","unstructured":"Michael Hamann and Ben Strasser . 2018 . Graph bisection with Pareto optimization . ACM J. Exper. Algor. 23 , 1 (2018), 1 .2:1--1.2:34. DOI:https:\/\/doi.org\/10.1145\/3173045 10.1145\/3173045 Michael Hamann and Ben Strasser. 2018. Graph bisection with Pareto optimization. ACM J. Exper. Algor. 23, 1 (2018), 1.2:1--1.2:34. DOI:https:\/\/doi.org\/10.1145\/3173045","journal-title":"ACM J. Exper. Algor."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"e_1_2_1_38_1","volume-title":"DIMACS Book","volume":"74","author":"Hilger Moritz","year":"2009","unstructured":"Moritz Hilger , Ekkehard K\u00f6hler , Rolf H. M\u00f6hring , and Heiko Schilling . 2009 . Fast point-to-point shortest path computations with arc-flags. In The Shortest Path Problem: Ninth DIMACS Implementation Challenge, Camil Demetrescu, Andrew V. Goldberg, and David S. Johnson (Eds.) . DIMACS Book , Vol. 74 . American Mathematical Society, 41--72. Moritz Hilger, Ekkehard K\u00f6hler, Rolf H. M\u00f6hring, and Heiko Schilling. 2009. Fast point-to-point shortest path computations with arc-flags. In The Shortest Path Problem: Ninth DIMACS Implementation Challenge, Camil Demetrescu, Andrew V. Goldberg, and David S. Johnson (Eds.). DIMACS Book, Vol. 74. American Mathematical Society, 41--72."},{"key":"e_1_2_1_39_1","first-page":"75","article-title":"Faster path-based algorithm for traffic assignment","volume":"1443","author":"Jayakrishnan R.","year":"1994","unstructured":"R. Jayakrishnan , Wei Kang Tsai , Joseph Prashker , and Subodh Rajadhyaksha . 1994 . Faster path-based algorithm for traffic assignment . Transport. Res. Rec. 1443 (1994), 75 -- 83 . R. Jayakrishnan, Wei Kang Tsai, Joseph Prashker, and Subodh Rajadhyaksha. 1994. Faster path-based algorithm for traffic assignment. Transport. Res. Rec. 1443 (1994), 75--83.","journal-title":"Transport. Res. Rec."},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(75)90001-0"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.5555\/2791188.2791192"},{"key":"e_1_2_1_42_1","volume-title":"The Art of Computer Programming: Sorting and Searching","author":"Knuth Donald E.","unstructured":"Donald E. Knuth . 1998. The Art of Computer Programming: Sorting and Searching . Addison-Wesley . Donald E. Knuth. 1998. The Art of Computer Programming: Sorting and Searching. Addison-Wesley."},{"key":"e_1_2_1_43_1","volume-title":"Proceedings of the 90th Transportation Research Board Annual Meeting (TRB\u201911)","author":"Kumar Amit","year":"2011","unstructured":"Amit Kumar and Srinivas Peeta . 2011 . An improved social pressure algorithm for static deterministic user equilibrium traffic assignment problem . In Proceedings of the 90th Transportation Research Board Annual Meeting (TRB\u201911) . Amit Kumar and Srinivas Peeta. 2011. An improved social pressure algorithm for static deterministic user equilibrium traffic assignment problem. In Proceedings of the 90th Transportation Research Board Annual Meeting (TRB\u201911)."},{"key":"e_1_2_1_44_1","volume-title":"SSE, and AVX","author":"Kusswurm Daniel","unstructured":"Daniel Kusswurm . 2014. Modern X86 Assembly Language Programming: 32-bit, 64-bit , SSE, and AVX . Apress . Daniel Kusswurm. 2014. Modern X86 Assembly Language Programming: 32-bit, 64-bit, SSE, and AVX. Apress."},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20662-7_21"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2013.06.114"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2015.05.169"},{"key":"e_1_2_1_48_1","volume-title":"Algorithms and Data Structures: The Basic Toolbox","author":"Mehlhorn Kurt","unstructured":"Kurt Mehlhorn and Peter Sanders . 2008. Algorithms and Data Structures: The Basic Toolbox . Springer . DOI:https:\/\/doi.org\/10.1007\/978-3-540-77978-0 10.1007\/978-3-540-77978-0 Kurt Mehlhorn and Peter Sanders. 2008. Algorithms and Data Structures: The Basic Toolbox. Springer. DOI:https:\/\/doi.org\/10.1007\/978-3-540-77978-0"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1120.0409"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trb.2009.06.005"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2014.08.024"},{"key":"e_1_2_1_52_1","unstructured":"PTV AG. 2014. PTV Visum 14 Manual.  PTV AG. 2014. PTV Visum 14 Manual."},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11771-011-0900-6"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561071_51"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38527-8_16"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-20086-6_22"},{"key":"e_1_2_1_57_1","volume-title":"Region Stuttgart: Schlussbericht. Unpublished.","author":"Schlaich Johannes","year":"2011","unstructured":"Johannes Schlaich , Udo Heidl , and R. Pohlner . 2011 . Verkehrsmodellierung f\u00fcr die Region Stuttgart: Schlussbericht. Unpublished. Johannes Schlaich, Udo Heidl, and R. Pohlner. 2011. Verkehrsmodellierung f\u00fcr die Region Stuttgart: Schlussbericht. Unpublished."},{"key":"e_1_2_1_58_1","volume-title":"Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods","author":"Sheffi Yosef","unstructured":"Yosef Sheffi . 1985. Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods . Prentice Hall . Yosef Sheffi. 1985. Urban Transportation Networks: Equilibrium Analysis with Mathematical Programming Methods. Prentice Hall."},{"key":"e_1_2_1_60_1","volume-title":"Proceedings of the 34th European Transport Conference (ETC\u201906)","author":"Slavin Howard","year":"2006","unstructured":"Howard Slavin , Jonathan Brandon , and Andres Rabinowicz . 2006 . An empirical comparison of alternative user equilibrium traffic assignment methods . In Proceedings of the 34th European Transport Conference (ETC\u201906) . Howard Slavin, Jonathan Brandon, and Andres Rabinowicz. 2006. An empirical comparison of alternative user equilibrium traffic assignment methods. In Proceedings of the 34th European Transport Conference (ETC\u201906)."},{"key":"e_1_2_1_61_1","volume-title":"Using OpenMP\u2014The Next Step","author":"van der Pas Ruud","unstructured":"Ruud van der Pas , Eric Stotzer , and Christian Terboven . 2017. Using OpenMP\u2014The Next Step . MIT Press . Ruud van der Pas, Eric Stotzer, and Christian Terboven. 2017. Using OpenMP\u2014The Next Step. MIT Press."},{"key":"e_1_2_1_62_1","first-page":"1","article-title":"Mobilit\u00e4t und Verkehr in der Region Stuttgart 2009\/2010: Regionale Haushaltsbefragung zum Verkehrsverhalten","volume":"29","author":"Stuttgart Verband Region","year":"2011","unstructured":"Verband Region Stuttgart . 2011 . Mobilit\u00e4t und Verkehr in der Region Stuttgart 2009\/2010: Regionale Haushaltsbefragung zum Verkehrsverhalten . Schriftenreihe Verband Region Stuttgart 29 (2011), 1 -- 138 . Verband Region Stuttgart. 2011. Mobilit\u00e4t und Verkehr in der Region Stuttgart 2009\/2010: Regionale Haushaltsbefragung zum Verkehrsverhalten. Schriftenreihe Verband Region Stuttgart 29 (2011), 1--138.","journal-title":"Schriftenreihe Verband Region Stuttgart"},{"key":"e_1_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1680\/ipeds.1952.11362"},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2010.5470362"}],"container-title":["ACM Journal of Experimental Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3362693","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3362693","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:44:54Z","timestamp":1750203894000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3362693"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,10]]},"references-count":61,"alternative-id":["10.1145\/3362693"],"URL":"https:\/\/doi.org\/10.1145\/3362693","relation":{},"ISSN":["1084-6654","1084-6654"],"issn-type":[{"value":"1084-6654","type":"print"},{"value":"1084-6654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,12,10]]}}}