{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:46:35Z","timestamp":1772163995023,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,9,20]],"date-time":"2008-09-20T00:00:00Z","timestamp":1221868800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,9,20]]},"DOI":"10.1145\/1411204.1411229","type":"proceedings-article","created":{"date-parts":[[2008,9,23]],"date-time":"2008-09-23T09:39:01Z","timestamp":1222162741000},"page":"169-178","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Write it recursively"],"prefix":"10.1145","author":[{"given":"Akimasa","family":"Morihata","sequence":"first","affiliation":[{"name":"University of Tokyo, Bunkyo-ku, Tokyo, Japan"}]},{"given":"Kiminori","family":"Matsuzaki","sequence":"additional","affiliation":[{"name":"University of Tokyo, Bunkyo-ku, Tokyo, Japan"}]},{"given":"Masato","family":"Takeichi","sequence":"additional","affiliation":[{"name":"University of Tokyo, Bunkyo-ku, Tokyo, Japan"}]}],"member":"320","published-online":{"date-parts":[[2008,9,20]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539798337716"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/647912.740806"},{"key":"e_1_3_2_2_3_1","volume-title":"Virginia Tech (USA)","author":"Barrett Christopher L.","year":"2007","unstructured":"Christopher L. Barrett, Keith Bisset, Riko Jacob, Goran Konjevod, Madhav V. Marathe, and Dorothea Wagner. Label constrained shortest path algorithms: An experimental evaluation using transportation networks. Technical report, Virginia Tech (USA), Arizona State University (USA), and Karlsruhe University (Germany), 2007."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/862270"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2003.12.019"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1321440.1321494"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1023063919574"},{"key":"e_1_3_2_2_8_1","first-page":"191","article-title":"A generalized permanent labeling algorithm for the shortest path problem with time windows","volume":"26","author":"Desrochers Martin","year":"1988","unstructured":"Martin Desrochers and Fran\u00e7ois Soumis. A generalized permanent labeling algorithm for the shortest path problem with time windows. INFOR, 26:191--212, 1988.","journal-title":"INFOR"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795290477"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2005.12.002"},{"key":"e_1_3_2_2_11_1","volume-title":"Solvable classes of discrete dynamic programming. Journal of mathematical analysis and applications, 43(3):642--693","author":"Ibaraki Toshihide","year":"1973","unstructured":"Toshihide Ibaraki. Solvable classes of discrete dynamic programming. Journal of mathematical analysis and applications, 43(3):642--693, 1973."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(78)90197-3"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/321992.321993"},{"key":"e_1_3_2_2_14_1","volume-title":"The shortest route problem with constraints. Journal of Mathematical analysis and applications, 14:191--197","author":"Joksch H. C.","year":"1966","unstructured":"H. C. Joksch. The shortest route problem with constraints. Journal of Mathematical analysis and applications, 14:191--197, 1966."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/0115060"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916274"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/996841.996868"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(84)90269-8"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979122370X"},{"key":"e_1_3_2_2_20_1","unstructured":"Akimasa Morihata Kiminori Matsuzaki Zhenjiang Hu and Masato Takeichi. Calculus of minimals: Deriving dynamic-programming algorithms based on preservation of monotonicity. Technical Report METR 2007-61 Department of Mathematical Informatics University of Tokyo 2007."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/944705.944716"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(91)90073-5"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90198-6"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/351240.351254"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.v48:2"},{"key":"e_1_3_2_2_26_1","volume-title":"The Boost Graph Library: User Guide and Reference Manual","author":"Siek Jeremy G.","year":"2001","unstructured":"Jeremy G. Siek, Lie-Quan Lee, and Andrew Lumsdaine. The Boost Graph Library: User Guide and Reference Manual. Addison-Wesley, 2001."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.01.032"}],"event":{"name":"ICFP08: ACM SIGPLAN International Conference on Functional Programming","location":"Victoria BC Canada","acronym":"ICFP08","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 13th ACM SIGPLAN international conference on Functional programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1411204.1411229","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1411204.1411229","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,14]],"date-time":"2025-08-14T16:40:48Z","timestamp":1755189648000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1411204.1411229"}},"subtitle":["a generic framework for optimal path queries"],"short-title":[],"issued":{"date-parts":[[2008,9,20]]},"references-count":27,"alternative-id":["10.1145\/1411204.1411229","10.1145\/1411204"],"URL":"https:\/\/doi.org\/10.1145\/1411204.1411229","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1411203.1411229","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2008,9,20]]},"assertion":[{"value":"2008-09-20","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}