{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T19:56:17Z","timestamp":1725652577348},"publisher-location":"Wiesbaden","reference-count":15,"publisher":"Vieweg+Teubner Verlag","isbn-type":[{"type":"print","value":"9783528057206"},{"type":"electronic","value":"9783322830920"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/978-3-322-83092-0_8","type":"book-chapter","created":{"date-parts":[[2012,1,16]],"date-time":"2012-01-16T10:14:35Z","timestamp":1326708875000},"page":"144-161","source":"Crossref","is-referenced-by-count":2,"title":["Deutschlandweite Verbindungsauskunft im \u00f6ffentlichen Personenverkehr Verteilte Wegesuche in Graphen"],"prefix":"10.1007","author":[{"given":"Thomas","family":"K\u00e4mpke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franz-Josef","family":"Radermacher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","volume-title":"Network flows","author":"R Ahuja","year":"1993","unstructured":"Ahuja, R., Magnanti, T.L., Orlin, J.B., \u201cNetwork flows\u201d, Prentice Hall, Englewood Cliffs, 1993."},{"key":"8_CR2","unstructured":"Car, A., Frank, A.U., \u201cHierarchical street networks as a conceptual model for efficient way finding\u201d, Proceedings 4th European conference on geographical information systems, Genoa, 1993, S. 134-139."},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"1004","DOI":"10.1137\/0216064","volume":"6","author":"GN Frederickson","year":"1987","unstructured":"Frederickson, G.N., \u201cFast algorithms for shortest paths in planar graphs, with applications\u201d, SIAM Journal on Computing 6, 1987, S. 1004\u20131022.","journal-title":"SIAM Journal on Computing"},{"key":"8_CR4","first-page":"185","volume":"24","author":"T K\u00e4mpke","year":"1994","unstructured":"K\u00e4mpke, T., \u201cA separation decomposition for orders\u201d, Networks 24, 1994, S. 185\u2013194.","journal-title":"A separation decomposition for orders"},{"key":"8_CR5","unstructured":"K\u00e4mpke, T., Schaal, M., \u201cDistributed generation of fastest paths\u201d, Proceedings of International Conference on Parallel and Distributed Computing and Systems PD-CS\u2019 98, Las Vegas, 1998, S. 172-177."},{"key":"8_CR6","unstructured":"K\u00e4mpke, T., Schaal, M., \u201cFast paths\u201d, Manuskript, 1998."},{"key":"8_CR7","volume-title":"Combinatorial optimization networks and matroids","author":"E Lawler","year":"1976","unstructured":"Lawler, E., \u201cCombinatorial optimization networks and matroids\u201d, Holt, Rinehart and Winston, New York, 1976."},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0377-2217(93)90095-5","volume":"69","author":"EQV Martins","year":"1993","unstructured":"Martins, E.Q.V. et al., \u201cAn algorithm for the ranking of shortest paths\u201d, European Journal of Operational Research 69, 1993, S. 97\u2013106.","journal-title":"European Journal of Operational Research"},{"key":"8_CR9","unstructured":"Martins, E.Q.V., Santos, J.L.E., \u201cA new shortest paths ranking algorithm\u201d, Manuskript, 1996."},{"key":"8_CR10","unstructured":"Mayer, J., \u201cDiskrete Transportprobleme: Modellierung und Optimierung\u201d, Dissertation, Universit\u00e4t Ulm, 1996."},{"key":"8_CR11","first-page":"257","volume":"19","author":"RH M\u00f6hring","year":"1984","unstructured":"M\u00f6hring, R.H., Radermacher, F.J., \u201cSubstitution decomposition for discrete structures and connections with combinatorial optimization\u201d, Annals of Discrete Mathematics 19, 1984, S. 257\u2013356.","journal-title":"Annals of Discrete Mathematics"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1145\/79147.214078","volume":"36","author":"A Orda","year":"1990","unstructured":"Orda, A., Row, R., \u201cShortest-path and minimum delay algorithms in networks with time dependent edge-length\u201d, Journal of the ACM 36, 1990, S. 607\u2013625.","journal-title":"Journal of the ACM"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1002\/net.3230210304","volume":"21","author":"A Orda","year":"1991","unstructured":"Orda, A., Row, R., \u201cMinimum weight paths in time-dependent networks\u201d, Networks 21, 1991, S. 295\u2013319.","journal-title":"Networks"},{"key":"8_CR14","volume-title":"Durchg\u00e4ngige Elektronische Fahrplaninformation \u2014 DELFI","author":"FJ Radermacher","year":"1997","unstructured":"Radermacher, F.J., Schaal, M., Schnittger, S., \u201cDurchg\u00e4ngige Elektronische Fahrplaninformation \u2014 DELFI\u201d, ITS Weltkongre\u00df, Berlin, 1997."},{"key":"8_CR15","doi-asserted-by":"publisher","DOI":"10.1002\/9781118033104","volume-title":"Graphs: theory and algorithms","author":"K Thulasiraman","year":"1992","unstructured":"Thulasiraman, K., Swamy, M.N.S., \u201cGraphs: theory and algorithms\u201d, Wiley, New York, 1992."}],"container-title":["Angewandte Mathematik, insbesondere Informatik"],"original-title":[],"language":"de","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-322-83092-0_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T17:18:00Z","timestamp":1619975880000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-322-83092-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783528057206","9783322830920"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-322-83092-0_8","relation":{},"subject":[],"published":{"date-parts":[[1999]]}}}