{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:02:02Z","timestamp":1725663722205},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540538325"},{"type":"electronic","value":"9783540463108"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-53832-1_30","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:13:54Z","timestamp":1330208034000},"page":"41-60","source":"Crossref","is-referenced-by-count":1,"title":["A generalized best-first search method in graphs"],"prefix":"10.1007","author":[{"given":"Ulrich","family":"Huckenbeck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Detlev","family":"Ruland","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"4_CR1","unstructured":"A.V.Aho, J.E.Hopcroft, J.D.Ullman, The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974."},{"issue":"1","key":"4_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2455.2458","volume":"32","author":"A. Bagghi","year":"1985","unstructured":"A. Bagghi, A. Mahanti, Three Approaches to Heuristic Search in Networks. Journal of the ACM, Vol. 32, No. 1, 1985, p. 1\u201327.","journal-title":"Journal of the ACM"},{"issue":"3","key":"4_CR3","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1145\/3828.3830","volume":"32","author":"R. Dechter","year":"1985","unstructured":"R. Dechter, J. Pearl, Generalized Best-First Search Strategies and the Optimality of A*. Journal of the ACM, Vol 32, No. 3, 1985, p. 505\u2013536.","journal-title":"Journal of the ACM"},{"key":"4_CR4","unstructured":"D.E.Knuth, The Art of Computer Programming, Vol. 1: Fundamental Algorithms. Addison Wesley 1982."},{"key":"4_CR5","unstructured":"N.J.Nilsson, Principles of Artificial Intelligence. Morgan Kaufmann Publishers, 1980."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-53832-1_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:16:11Z","timestamp":1619572571000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-53832-1_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540538325","9783540463108"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/3-540-53832-1_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}