{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:49Z","timestamp":1725663409279},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540542339"},{"type":"electronic","value":"9783540475163"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54233-7_144","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:37:25Z","timestamp":1330191445000},"page":"314-326","source":"Crossref","is-referenced-by-count":10,"title":["Efficient algorithms for path problems with general cost criteria"],"prefix":"10.1007","author":[{"given":"T.","family":"Lengauer","sequence":"first","affiliation":[]},{"given":"D.","family":"Theune","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"24_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. V. Aho","year":"1974","unstructured":"A. V. Aho, J. E. Hopcroft, and J. D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley Series in Computer Science and Engineering. Addison-Wesley, Reading, MA, 1974."},{"key":"24_CR2","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"R. E. Bellman","year":"1958","unstructured":"R. E. Bellman. On a routing problem. Quarterly Applied Mathematics, 16:87\u201390, 1958.","journal-title":"Quarterly Applied Mathematics"},{"issue":"3","key":"24_CR3","doi-asserted-by":"crossref","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*. Journal of the Association for Computing Machinery, 32(3):505\u2013536, 1985.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"24_CR4","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E. W. Dijkstra","year":"1959","unstructured":"E. W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269\u2013271, 1959.","journal-title":"Numerische Mathematik"},{"key":"24_CR5","series-title":"Technical Report","volume-title":"Network flow theory","author":"L. R. Ford","year":"1956","unstructured":"L. R. Ford. Network flow theory. Technical Report P-923, RAND Corp., Santa Monica, CA, 1956."},{"issue":"3","key":"24_CR6","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M. R. Fredman","year":"1987","unstructured":"M. R. Fredman and R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the Association for Computing Machinery, 34(3):596\u2013615, 1987.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"24_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA, 1979."},{"key":"24_CR8","volume-title":"Combinatorial Theory","author":"M. Hall Jr.","year":"1967","unstructured":"M. Hall Jr. Combinatorial Theory. John Wiley & Sons, New York, 1967."},{"issue":"2","key":"24_CR9","doi-asserted-by":"crossref","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 Transactions on Systems, Science and Cybernetics, SCC-4(2):100\u2013107, 1968.","journal-title":"IEEE Transactions on Systems, Science and Cybernetics"},{"key":"24_CR10","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J. E. Hopcroft","year":"1979","unstructured":"J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley Series in Computer Science. Adds that cison-Wesley, Reading, MA, 1979."},{"key":"24_CR11","first-page":"139","volume-title":"VLSI Layout: Theory and Design","author":"T. C. Hu","year":"1985","unstructured":"T. C. Hu and M. T. Shing. The alpha-beta routing. In T. C. Hu and E. S. Kuh, editors, VLSI Layout: Theory and Design, pages 139\u2013143. IEEE Press, New York, 1985."},{"key":"24_CR12","unstructured":"U. Huckenbeck and D. Ruland. A generalized best-first search method in graphs. In R. M\u00f6hring, editor, Proceedings of the 16th International Workshop on Graphtheoretic Concepts in Computer Science (WG'90), New York, 1990. Springer Lecture Notes in Computer Science, No. 484, Springer Verlag."},{"key":"24_CR13","unstructured":"W. John. Remarks to the solution of EMC-Problems on printed circuit boards. In Proceedings of the Seventh International Conference on Electromagnetic Compatibility, York, U.K., 1990."},{"key":"24_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-92106-2","volume-title":"Combinatorial Algorithms for Integrated Circuit Layout","author":"T. Lengauer","year":"1990","unstructured":"T. Lengauer. Combinatorial Algorithms for Integrated Circuit Layout. Teubner-Wiley Series of Applicable Theory in Computer Science. John Wiley & Sons, New York, 1990."},{"key":"24_CR15","unstructured":"T. Lengauer and D. Theune. Unstructured path problems and the making of semirings. Typescript, Fachbereich Mathematik-Informatik, Universit\u00e4t Gesamthochschule Paderborn, 1991."},{"key":"24_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69897-2","volume-title":"Data Structures and Algorithms II: Graph Algorithms and NP-completeness, volume 2 of EATCS Monographs on Theoretical Computer Science","author":"K. Mehlhorn","year":"1984","unstructured":"K. Mehlhorn. Data Structures and Algorithms II: Graph Algorithms and NP-completeness, volume 2 of EATCS Monographs on Theoretical Computer Science. Springer Verlag, New York, 1984."},{"key":"24_CR17","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/978-3-7091-9076-0_9","volume":"7","author":"G. Rote","year":"1990","unstructured":"G. Rote. Path problems in graphs. Computing Supplement, 7:155\u2013189, 1990.","journal-title":"Computing Supplement"},{"key":"24_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-5060(08)70423-0","volume":"10","author":"U. Zimmermann","year":"1981","unstructured":"U. Zimmermann. Linear and combinatorial optimization in ordered algebraic structures. (Especially chapter 8: Algebraic path problems.) Ann. Discrete Math. 10, 1\u2013380, 1981.","journal-title":"Ann. Discrete Math."},{"key":"24_CR19","series-title":"CBMS-NSF Regional Conference Series in Applied Mathematics","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970265","volume-title":"Data Structures and Network Algorithms","author":"R. E. Tarjan","year":"1983","unstructured":"R. E. Tarjan. Data Structures and Network Algorithms. CBMS-NSF Regional Conference Series in Applied Mathematics No. 44. Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54233-7_144.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:20:19Z","timestamp":1619558419000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54233-7_144"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540542339","9783540475163"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-54233-7_144","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}