{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:40:12Z","timestamp":1743104412445,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540664277"},{"type":"electronic","value":"9783540483182"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48318-7_11","type":"book-chapter","created":{"date-parts":[[2007,10,25]],"date-time":"2007-10-25T20:20:56Z","timestamp":1193343656000},"page":"110-123","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["Dijkstra\u2019s Algorithm On-Line: An Empirical Case Study from Public Railroad Transport"],"prefix":"10.1007","author":[{"given":"Frank","family":"Schulz","sequence":"first","affiliation":[]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[]},{"given":"Karsten","family":"Weihe","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,27]]},"reference":[{"key":"11_CR1","unstructured":"S. Albers, A. Crauser, and K. Mehlhorn: Algorithmen f\u00fcr sehr gro\u00dfe Datenmengen. MPI Saarbr\u00fccken (1997).7"},{"key":"11_CR2","unstructured":"K. Ishikawa, M. Ogawa, S. Azume, and T. Ito: Map Navigation Software of the Electro Multivision of the\u2019 91 Toyota Soarer. IEEE Int. Conf. Vehicle Navig. Inform. Syst. (VNIS\u2019 91), 463\u2013473."},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1109\/69.277767","volume":"6","author":"R. Agrawal","year":"1994","unstructured":"R. Agrawal and H. Jagadish: Algorithms for Searching Massive Graphs. IEEE Transact. Knowledge and Data Eng. 6 (1994), 225\u2013238.","journal-title":"IEEE Transact. Knowledge and Data Eng."},{"key":"11_CR4","unstructured":"R.K. Ahuja, T.L. Magnanti, and J.B. Orlin: Network Flows. Prentice-Hall, 1993."},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"A. Car and A. Frank: Modelling a Hierarchy of Space Applied to Large Road Networks. Proc. Int. Worksh. Adv. Research Geogr. Inform. Syst. (IGIS\u2019 94), 15\u201324.","DOI":"10.1007\/3-540-58795-0_30"},{"key":"11_CR6","first-page":"129","volume":"73","author":"B.V. Cherkassky","year":"1996","unstructured":"B.V. Cherkassky, A.V. Goldberg und T. Radzik: Shortest Paths Algorithms: Theory and Experimental Evaluation. Mathematical Programming 73 (1996), 129\u2013174.","journal-title":"Mathematical Programming"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"S. Shekhar, A. Kohli, and M. Coyle: Path Computation Algorithms for Advanced Traveler Information System (ATIS). Proc. 9th IEEE Int. Conf. Data Eng. (1993), 31\u201339.","DOI":"10.1109\/ICDE.1993.344080"},{"key":"11_CR8","unstructured":"T.H. Cormen, C.E. Leiserson, and R.L. Rivest: Introduction to Algorithms. MIT Press and McGraw-Hill, 1994."},{"key":"11_CR9","unstructured":"S. Jung and S. Pramanik: HiTi Graph Model of Topographical Road Maps in Navigation Systems. Proc. 12th IEEE Int. Conf. Data Eng. (1996), 76\u201384."},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"T. Lengauer: Combinatorial Algorithms for Integrated Circuit Layout.Wiley, 1990.","DOI":"10.1007\/978-3-322-92106-2"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1002\/net.3230220707","volume":"22","author":"J. Shapiro","year":"1992","unstructured":"J. Shapiro, J. Waxman, and D. Nir: Level Graphs and Approximate Shortest Path Algorithms. Network 22 (1992), 691\u2013717.","journal-title":"Network"},{"key":"11_CR12","unstructured":"T. Preuss and J.-H. Syrbe: An Integrated Traffic Information System. Proc. 6th Int. Conf. Appl. Computer Networking in Architecture, Construction, Design, Civil Eng., and Urban Planning (europIA\u2019 97)."},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"K. Weihe: Reuse of Algorithms \u2014 Still a Challenge to Object-Oriented Programming. Proc. 12th ACM Symp. Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA\u2019 97), 34\u201348.","DOI":"10.1145\/263700.263704"},{"key":"11_CR14","unstructured":"K. Weihe, U. Brandes, A. Liebers, M. M\u00fcller-Hannemann, D. Wagner, and T. Willhalm: Empirical Design of Geometric Algorithms. To appear in the Proc. 15th ACM Symp. Comp. Geometry (SCG\u2019 99)."}],"container-title":["Lecture Notes in Computer Science","Algorithm Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48318-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T22:29:06Z","timestamp":1737498546000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48318-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664277","9783540483182"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-48318-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"27 July 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}