{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T19:56:09Z","timestamp":1725652569907},"publisher-location":"Wiesbaden","reference-count":19,"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_11","type":"book-chapter","created":{"date-parts":[[2012,1,16]],"date-time":"2012-01-16T05:14:35Z","timestamp":1326690875000},"page":"192-220","source":"Crossref","is-referenced-by-count":8,"title":["Verteilte Verbindungssuche im \u00f6ffentlichen Personenverkehr Graphentheoretische Modelle und Algorithmen"],"prefix":"10.1007","author":[{"given":"Rolf H.","family":"M\u00f6hring","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","volume-title":"Network Flows. Theory, Algorithms, and Applications","author":"RK Ahuja","year":"1993","unstructured":"R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows. Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, NJ, 1993."},{"key":"11_CR2","first-page":"129","volume":"73","author":"BV Cherkassy","year":"1996","unstructured":"B. V. Cherkassy, A. V. Goldberg, and T. Radzik. Shortest path algorithms: Theory and experimental evaluation. Math. Programming, 73:129\u2013174, 1996.","journal-title":"Math. Programming"},{"issue":"3","key":"11_CR3","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1145\/3828.3830","volume":"32","author":"R Dechter","year":"1985","unstructured":"R. Dechter and J. Pearl. Generalized best-first search strategies and the optimality of A*. J. Assoc. Comp. Mach., 32(3):505\u2013536, 1985.","journal-title":"J. Assoc. Comp. Mach."},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"1004","DOI":"10.1137\/0216064","volume":"16","author":"GN Frederickson","year":"1987","unstructured":"G. N. Frederickson. Fast algorithms for shortest paths in planar graphs with applications. SIAM J. Comput., 16:1004\u20131022, 1987.","journal-title":"SIAM J. Comput."},{"key":"11_CR5","volume-title":"Graphs and Algorithms","author":"M Gondran","year":"1984","unstructured":"M. Gondran and M. Minoux. Graphs and Algorithms. John Wiley & Sons, New York, 1984."},{"issue":"2","key":"11_CR6","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"SCC-4","author":"P Hart","year":"1968","unstructured":"P. Hart, N. Nilsson, and B. Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Systems, Science and Cybernetics, SCC-4(2): 100\u2013107, 1968.","journal-title":"IEEE Trans. Systems, Science and Cybernetics"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"U. Huckenbeck and D. Ruland. A generalized best-first search method in graphs. In R. H. M\u00f6hring, editor, Proceedings 16th International Workshop on Graph-Theoretic Concepts in Computer Science WG\u201990, pages 41-60. Springer-Verlag, Lecture Notes in Computer Science, vol. 484, 1990.","DOI":"10.1007\/3-540-53832-1_30"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/net.3230140109","volume":"14","author":"JM Jaffe","year":"1984","unstructured":"J. M. Jaffe. Algorithms for finding paths with multiple constraints. Networks, 14:95\u2013116, 1984.","journal-title":"Networks"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"T. K\u00e4mpke and F. J. Radermacher. Deutschlandweite Verbindungsauskunft im \u00f6ffentlichen Personennahverkehr: verteilte Wegesuche in Graphen. Manuskript, 1999.","DOI":"10.1007\/978-3-322-83092-0_8"},{"key":"11_CR10","first-page":"184","volume-title":"Proceedings 9th International Workshop on Graph-Theoretic Concepts in Computer Science WG\u201983","author":"EL Lawler","year":"1983","unstructured":"E. L. Lawler, M. G. Luby, and B. Parker. Finding shortest paths in very large networks. In M. Nagl and J. Perl, editors, Proceedings 9th International Workshop on Graph-Theoretic Concepts in Computer Science WG\u201983, pages 184\u2013199. Trauner Verlag, Linz, 1983."},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"T. Lengauer. Combinatorial Algorithms for Integrated Circuit Layout. Wiley-Teubner, 1990.","DOI":"10.1007\/978-3-322-92106-2_3"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"1063","DOI":"10.1137\/0217068","volume":"17","author":"T Lengauer","year":"1988","unstructured":"T. Lengauer and E. Wanke. Efficient solutions of connectivity problems on hierarchically defined graphs. SIAM J. Comput., 17:1063\u20131080, 1988.","journal-title":"SIAM J. Comput."},{"key":"11_CR13","unstructured":"N. J. Nilsson. Principles of Artificial Intelligence. Morgan Kaufmann Publishers, 1980."},{"key":"11_CR14","first-page":"127","volume-title":"Machine Intelligence","author":"I Pohl","year":"1971","unstructured":"I. Pohl. Bi-directional search. In B. Meltzer and D. Mitchie, editors, Machine Intelligence, pages 127\u2013140. Edinburgh University Press, Edinburgh, 1971."},{"key":"11_CR15","unstructured":"B. Riedhofer. Hierarchische Stra\u00dfengraphen. Master\u2019s thesis, Universit\u00e4t Stuttgart, Fakult\u00e4t Informatik, 1997."},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"G. Rote. Path problems in graphs. In G. Tinhofer, E. Mayr, H. Noltemeier, and M. Syslo, editors, Computational Graph Theory, Computing Supplementum 7, pages 155\u2013190. Springer-Verlag Wien, 1990.","DOI":"10.1007\/978-3-7091-9076-0_9"},{"key":"11_CR17","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BF01840435","volume":"1","author":"R Sedgewick","year":"1986","unstructured":"R. Sedgewick and J. S. Vitter. Shortest paths in Euclidean graphs. Algorithmica, 1:31\u201348, 1986.","journal-title":"Algorithmica"},{"key":"11_CR18","volume-title":"Robuste und effiziente Methoden zur L\u00f6sung von Wegproblemen","author":"D Theune","year":"1995","unstructured":"D. Theune. Robuste und effiziente Methoden zur L\u00f6sung von Wegproblemen. Teubner Verlag, Stuttgart, 1995."},{"issue":"1","key":"11_CR19","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1287\/opre.35.1.70","volume":"35","author":"A Warburton","year":"1987","unstructured":"A. Warburton. Approximation of Pareto optima in multiple-objective, shortest-path problems. Oper. Res., 35(1):70\u201379, 1987.","journal-title":"Oper. Res."}],"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_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T13:17:54Z","timestamp":1619961474000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-322-83092-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783528057206","9783322830920"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-322-83092-0_11","relation":{},"subject":[],"published":{"date-parts":[[1999]]}}}