{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:58:03Z","timestamp":1750309083921,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,9]],"date-time":"2018-07-09T00:00:00Z","timestamp":1531094400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100007601","name":"Horizon 2020","doi-asserted-by":"publisher","award":["731581"],"award-info":[{"award-number":["731581"]}],"id":[{"id":"10.13039\/501100007601","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NSRF 2014-2020","award":["MIS 5002437\/3"],"award-info":[{"award-number":["MIS 5002437\/3"]}]},{"name":"Horizon 2020 (2)","award":["653747"],"award-info":[{"award-number":["653747"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,9]]},"DOI":"10.1145\/3221269.3223038","type":"proceedings-article","created":{"date-parts":[[2018,7,10]],"date-time":"2018-07-10T16:26:42Z","timestamp":1531240002000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Finding shortest keyword covering routes in road networks"],"prefix":"10.1145","author":[{"given":"Vassilis","family":"Kaffes","sequence":"first","affiliation":[{"name":"University of the Peloponnese"}]},{"given":"Alexandros","family":"Belesiotis","sequence":"additional","affiliation":[{"name":"Research Center \"Athena\""}]},{"given":"Dimitrios","family":"Skoutas","sequence":"additional","affiliation":[{"name":"Research Center \"Athena\""}]},{"given":"Spiros","family":"Skiadopoulos","sequence":"additional","affiliation":[{"name":"University of the Peloponnese"}]}],"member":"320","published-online":{"date-parts":[[2018,7,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Ittai Abraham Daniel Delling Andrew V Goldberg and Renato F Werneck. 2011. A hub-based labeling algorithm for shortest paths in road networks. In SEA. 230--241.   Ittai Abraham Daniel Delling Andrew V Goldberg and Renato F Werneck. 2011. A hub-based labeling algorithm for shortest paths in road networks. In SEA. 230--241.","DOI":"10.1007\/978-3-642-20662-7_20"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465315"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Julian Arz Dennis Luxen and Peter Sanders. 2013. Transit node routing reconsidered. In SEA. 55--66.  Julian Arz Dennis Luxen and Peter Sanders. 2013. Transit node routing reconsidered. In SEA. 55--66.","DOI":"10.1007\/978-3-642-38527-8_7"},{"key":"e_1_3_2_1_4_1","volume-title":"Werneck","author":"Bast Hannah","year":"2015","unstructured":"Hannah Bast , Daniel Delling , Andrew V. Goldberg , Matthias M\u00fcller-Hannemann , Thomas Pajor , Peter Sanders , Dorothea Wagner , and Renato F . Werneck . 2015 . Route planning in transportation networks. CoRR abs\/1504.05140 (2015). Hannah Bast, Daniel Delling, Andrew V. Goldberg, Matthias M\u00fcller-Hannemann, Thomas Pajor, Peter Sanders, Dorothea Wagner, and Renato F. Werneck. 2015. Route planning in transportation networks. CoRR abs\/1504.05140 (2015)."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2666310.2666411"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350234"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2820783.2820846"},{"key":"e_1_3_2_1_8_1","volume-title":"Werneck","author":"Delling Daniel","year":"2013","unstructured":"Daniel Delling , Julian Dibbelt , Thomas Pajor , Dorothea Wagner , and Renato F . Werneck . 2013 . Computing multimodal journeys in practice. In SEA. 260--271. Daniel Delling, Julian Dibbelt, Thomas Pajor, Dorothea Wagner, and Renato F. Werneck. 2013. Computing multimodal journeys in practice. In SEA. 260--271."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1110.0448"},{"key":"e_1_3_2_1_10_1","volume-title":"Engineering route planning algorithms. Algorithmics of Large and Complex Networks","author":"Delling Daniel","year":"2009","unstructured":"Daniel Delling , Peter Sanders , Dominik Schultes , and Dorothea Wagner . 2009. Engineering route planning algorithms. Algorithmics of Large and Complex Networks ( 2009 ), 117--139. Daniel Delling, Peter Sanders, Dominik Schultes, and Dorothea Wagner. 2009. Engineering route planning algorithms. Algorithmics of Large and Complex Networks (2009), 117--139."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2424321.2424400"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-014-9242-5"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1110.0401"},{"key":"e_1_3_2_1_15_1","unstructured":"Andrew V Goldberg and Chris Harrelson. 2005. Computing the shortest path: A* search meets graph theory. In SODA. 156--165.   Andrew V Goldberg and Chris Harrelson. 2005. Computing the shortest path: A * search meets graph theory. In SODA. 156--165."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Moritz Hilger Ekkehard K\u00f6hler Rolf H. M\u00f6hring and Heiko Schilling. 2006. Fast point-to-point shortest path computations with arc-flags. (2006) 41--72.  Moritz Hilger Ekkehard K\u00f6hler Rolf H. M\u00f6hring and Heiko Schilling. 2006. Fast point-to-point shortest path computations with arc-flags. (2006) 41--72.","DOI":"10.1090\/dimacs\/074\/03"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/11535331_16"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30850-5_30"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544888"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2525314.2525342"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-006-0038-6"},{"key":"e_1_3_2_1_22_1","first-page":"97","article-title":"Generalized traveling salesman problem through n sets of nodes","volume":"7","author":"Srivastava SS","year":"1969","unstructured":"SS Srivastava , Santosh Kumar , RC Garg , and Prasenjit Sen . 1969 . Generalized traveling salesman problem through n sets of nodes . CORS journal 7 (1969), 97 -- 101 . SS Srivastava, Santosh Kumar, RC Garg, and Prasenjit Sen. 1969. Generalized traveling salesman problem through n sets of nodes. CORS journal 7 (1969), 97--101.","journal-title":"CORS journal"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1984.162"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.14778\/2140436.2140438"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2093973.2094001"}],"event":{"name":"SSDBM '18: 30th International Conference on Scientific and Statistical Database Management","acronym":"SSDBM '18","location":"Bozen-Bolzano Italy"},"container-title":["Proceedings of the 30th International Conference on Scientific and Statistical Database Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3221269.3223038","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3221269.3223038","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:43:29Z","timestamp":1750286609000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3221269.3223038"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,9]]},"references-count":25,"alternative-id":["10.1145\/3221269.3223038","10.1145\/3221269"],"URL":"https:\/\/doi.org\/10.1145\/3221269.3223038","relation":{},"subject":[],"published":{"date-parts":[[2018,7,9]]},"assertion":[{"value":"2018-07-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}