{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T01:56:57Z","timestamp":1775440617820,"version":"3.50.1"},"publisher-location":"Providence, Rhode Island","reference-count":0,"publisher":"American Mathematical Society","isbn-type":[{"value":"9780821843833","type":"print"},{"value":"9780821885864","type":"print"},{"value":"9781470417789","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,7,28]]},"DOI":"10.1090\/dimacs\/074\/05","type":"book-chapter","created":{"date-parts":[[2017,4,26]],"date-time":"2017-04-26T22:34:37Z","timestamp":1493246077000},"page":"93-139","source":"Crossref","is-referenced-by-count":30,"title":["Reach for A*: shortest path algorithms with preprocessing"],"prefix":"10.1090","author":[{"given":"Andrew","family":"Goldberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haim","family":"Kaplan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renato","family":"Werneck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"14","container-title":["DIMACS Series in Discrete Mathematics and Theoretical Computer Science","The Shortest Path Problem"],"original-title":[],"language":"en","deposited":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T00:56:53Z","timestamp":1775437013000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ams.org\/dimacs\/074"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7,28]]},"ISBN":["9780821843833","9780821885864","9781470417789"],"references-count":0,"URL":"https:\/\/doi.org\/10.1090\/dimacs\/074\/05","relation":{},"ISSN":["1052-1798","2472-4793"],"issn-type":[{"value":"1052-1798","type":"print"},{"value":"2472-4793","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,7,28]]}}}