{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:11:52Z","timestamp":1725664312501},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540603436"},{"type":"electronic","value":"9783540449447"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60343-3_29","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:19:25Z","timestamp":1330262365000},"page":"101-112","source":"Crossref","is-referenced-by-count":3,"title":["Efficient memory-limited graph search"],"prefix":"10.1007","author":[{"given":"J\u00fcrgen","family":"Eckerle","sequence":"first","affiliation":[]},{"given":"Sven","family":"Schuierer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"issue":"2","key":"8_CR1","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0004-3702(89)90010-6","volume":"41","author":"P. P. Chakrabarti","year":"1989","unstructured":"Chakrabarti, P. P., Ghose, S., Acharya, A., and de Sarkar, S. C., Heuristic search in restricted memory, Artif. Intell. 41 (2) (1989), 197\u2013221.","journal-title":"Artif. Intell."},{"key":"8_CR2","volume-title":"Tech. Report No. 57","author":"J. Eckerle","year":"1994","unstructured":"Eckerle, J., Schuierer, S., Efficient Space-Limited Graph Search Algorithms (In German), Tech. Report No. 57, Institut f\u00fcr Informatik, AL-Universit\u00e4t Freiburg, September 1994. (anonymous ftp from ftp.informatik.uni-freiburg.de in directory\/documents\/reports\/report)"},{"issue":"No.3","key":"8_CR3","first-page":"596","volume":"34","author":"M. L. Fredman","year":"1987","unstructured":"Fredman, M. L., Tarjan, R. E., Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms, J.A.C.M., Vol. 34, No. 3, (1987), 596\u2013615","journal-title":"J.A.C.M."},{"key":"8_CR4","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/0020-0190(91)90203-T","volume":"40","author":"S. Ghosh","year":"1991","unstructured":"Ghosh, S., and Mahanti, A., Bidirectional Heuristic Search with Limited Resources, Inform. Process. Letters 40 (1991), 335\u2013340.","journal-title":"Inform. Process. Letters"},{"key":"8_CR5","unstructured":"Ghosh, S., Mahanti, A., and Nau, D. S., ITS: An Efficient Limited-Memory Heuristic Tree Search Algorithm, in: Proc. of AAAI-94, Menlo Park, California, USA (1994), 1353\u20131358."},{"key":"8_CR6","unstructured":"Kaindl, H., Khorsand, A., Memory-Bounded Bidirectional Search, in: Proc. of AAAI-94, Menlo Park, California, USA (1994), 1359\u20131364."},{"issue":"1","key":"8_CR7","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","volume":"27","author":"R. E. Korf","year":"1985","unstructured":"Korf, R. E., Depth-First Iterative Deepening: An Optimal Admissible Tree Search, Artif. Intell. 27 (1) (1985), 97\u2013109.","journal-title":"Artif. Intell."},{"key":"8_CR8","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0004-3702(93)90045-D","volume":"62","author":"R. E. Korf","year":"1993","unstructured":"Korf, R. E., Linear-Space Best-First Search, Artif. Intell. 62 (1993), 41\u201378.","journal-title":"Artif. Intell."},{"key":"8_CR9","first-page":"544","volume-title":"Proc. of AAAI-92","author":"A. Mahanti","year":"1992","unstructured":"Mahanti, A., Ghosh, S., Nau, D. S., Pal, A. K., and Kanal, L., Performance of IDA*\non Trees and Graphs, in: Proc. of AAAI-92, San Jose, Los Altos, CA.: Kaufmann (1992), 544\u2013549."},{"key":"8_CR10","unstructured":"Pearl, J., Heuristics: Intelligent Search Strategies for Computer Problem Solving, Addison-Wesley, 1984."},{"key":"8_CR11","unstructured":"Reinefeld, A., Complete Solution of the Eight-Puzzle and the Benefit of Node Ordering in IDA*, in: Proceedings IJCAI-93, Chamb\u00e9ry, France, 248\u2013253"},{"key":"8_CR12","unstructured":"Russell, S., Efficient Memory-Bounded Search Methods,in: Proceedings ECAI-92, Vienna, Austria (1992), 1\u20135."},{"key":"8_CR13","unstructured":"Sen, A. K., Bagchi, A., Fast Recursive Formulations for Best-First Search that Allow Controlled Use of Memory, in: Proceedings IJCAI-89, Detroit, MI (1989), 297\u2013302."},{"issue":"2","key":"8_CR14","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0004-3702(91)90100-X","volume":"50","author":"A. K. Sen","year":"1991","unstructured":"Sen, A. K., Bagchi, A., Reducing Reexpansions in Iterative-Deepening Search by Controlling Cutoff Bounds, Artif. Intell. 50 (2) (1991), 207\u2013221.","journal-title":"Artif. Intell."}],"container-title":["Lecture Notes in Computer Science","KI-95: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60343-3_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:37:20Z","timestamp":1619559440000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60343-3_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540603436","9783540449447"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-60343-3_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}