{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:19:47Z","timestamp":1740122387982,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,7,6]],"date-time":"2022-07-06T00:00:00Z","timestamp":1657065600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,7,6]],"date-time":"2022-07-06T00:00:00Z","timestamp":1657065600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61572345"],"award-info":[{"award-number":["61572345"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s10878-022-00878-7","type":"journal-article","created":{"date-parts":[[2022,7,6]],"date-time":"2022-07-06T23:04:35Z","timestamp":1657148675000},"page":"1104-1133","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An efficient approach for searching optimal multi-keywords coverage routes"],"prefix":"10.1007","volume":"44","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5546-7965","authenticated-orcid":false,"given":"Rong","family":"Yang","sequence":"first","affiliation":[]},{"given":"Baoning","family":"Niu","sequence":"additional","affiliation":[]},{"given":"Pengfei","family":"Jin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,6]]},"reference":[{"issue":"1","key":"878_CR1","first-page":"41","volume":"21","author":"L Anthoor","year":"2015","unstructured":"Anthoor L, Resna R (2015) Optimal Route Queries for Road Networks with User Interest. Trends Food Sci & Technol 21(1):41\u201345","journal-title":"Trends Food Sci & Technol"},{"key":"878_CR2","doi-asserted-by":"crossref","unstructured":"Bao JL, Yang XC, Wang BZ, Wang JY (2013) An Efficient Trip Planning Algorithm under Constraints. Proceedings of Web Information System and Application Conference (WISA\u201913), 429-434","DOI":"10.1109\/WISA.2013.87"},{"key":"878_CR3","unstructured":"Cao X, Chen L, Cong G, Guan J, Phan NT, Xiao X (2013) KORS: Keyword-aware Optimal Route Search System. IEEE 29th Int Conf Data Eng (ICDE\u201913), 1340-1343"},{"key":"878_CR4","doi-asserted-by":"crossref","unstructured":"Cao X, Chen L, Cong G, Xiao X (2012) Keyword-aware optimal route search. Proc VLDB Endow(VLDB\u201912). 5(11):1136-1147","DOI":"10.14778\/2350229.2350234"},{"key":"878_CR5","doi-asserted-by":"publisher","unstructured":"Chen H, Ku W, Sun M, Zimmermann R (2008) The multi-rule partial sequenced route query. ACM SIGSPATIAL International Symposium on Advances in Geographic Information Systems (ACM-GIS\u201908), 57\u201364, https:\/\/doi.org\/10.1145\/1463434.1463448","DOI":"10.1145\/1463434.1463448"},{"key":"878_CR6","doi-asserted-by":"crossref","unstructured":"Chen Z, Shen HT, Zhou X (2011) Discovering popular routes from trajectories. Proce 27th Int Conf Data Eng (ICDE\u201911), 900-911","DOI":"10.1109\/ICDE.2011.5767890"},{"key":"878_CR7","doi-asserted-by":"crossref","unstructured":"Chen D, Yuan Y, Du W, Cheng Y, Wang G (2021) Online Route Planning over Time-Dependent Road Networks. 2021 IEEE 37th Int Conf Data Eng (ICDE\u201921), 325-335","DOI":"10.1109\/ICDE51399.2021.00035"},{"issue":"1","key":"878_CR8","doi-asserted-by":"publisher","first-page":"337","DOI":"10.14778\/1687627.1687666","volume":"2","author":"G Cong","year":"2009","unstructured":"Cong G, Jensen CS, Wu D (2009) Efficient retrieval of the top-k most relevant spatial web objects. Proce VLDB Endow 2(1):337\u2013348","journal-title":"Proce VLDB Endow"},{"key":"878_CR9","volume-title":"Int Alg Third Edition 1292","author":"TH Cormen","year":"2009","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Int Alg Third Edition 1292. The MIT Press, New York, USA"},{"issue":"3","key":"878_CR10","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1002\/net.10090","volume":"42","author":"I Dumitrescu","year":"2003","unstructured":"Dumitrescu I, Boland N (2003) Improved preprocessing, labeling and scaling algorithms for the weight-constrained shortest path problem. Networks 42(3):135\u2013153","journal-title":"Networks"},{"key":"878_CR11","doi-asserted-by":"crossref","unstructured":"Floyd and Robert W (1962) Algorithm 97: shortest path. Commun ACM 5(6):345","DOI":"10.1145\/367766.368168"},{"key":"878_CR12","doi-asserted-by":"crossref","unstructured":"Hao JY, Niu BN, Qin X (2019) A Keyword-Aware Optimal Route Query Algorithm on Large-Scale Road Networks. Int Conf Mobile Data Man-agement (MDM\u201919), 587-592","DOI":"10.1109\/MDM.2019.00124"},{"key":"878_CR13","unstructured":"http:\/\/www.dis.uniroma1.it\/%7Echallenge9\/"},{"issue":"2","key":"878_CR14","first-page":"352","volume":"37","author":"PF Jin","year":"2017","unstructured":"Jin PF, Niu BN, Zhang XZ (2017) KSRG:an efficient optimal route query algorithm for multi-keyword coverage. J Comput Appl 37(2):352\u2013359","journal-title":"J Comput Appl"},{"issue":"5","key":"878_CR15","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1109\/TKDE.2012.36","volume":"25","author":"J Li","year":"2013","unstructured":"Li J, Yang YD, Mamoulis N (2013) Optimal route queries with arbitrary order constraints. IEEE Trans Knowl Data Eng 25(5):1097\u20131110","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"878_CR16","doi-asserted-by":"crossref","unstructured":"Li F, Cheng D, Hadjieleftheriou M, Kollios G, Teng SH (2005) On trip planning queries in spatial databases. International Symposium on Spatial and Temporal Databases (SSTD\u201905), 273-290","DOI":"10.1007\/11535331_16"},{"key":"878_CR17","doi-asserted-by":"crossref","unstructured":"Liu H, Jin C, Yang B, Zhou A (2018) Finding Top-k Optimal Sequenced Routes. 2018 IEEE 34th Int Conf Data Eng (ICDE\u201918), 569-580","DOI":"10.1109\/ICDE.2018.00058"},{"key":"878_CR18","doi-asserted-by":"crossref","unstructured":"Li Y, Yang W, Dan W, Xie Z (2015) Keyword-aware dominant route search for various user preferences. IEEE Int Conf Database Syst Adv Appl (DASFAA\u201915), 207-222","DOI":"10.1007\/978-3-319-18123-3_13"},{"key":"878_CR19","doi-asserted-by":"crossref","unstructured":"Li W, Zhu H, Liu W, Yin J, Xu J (2021) Optimal Sequenced Route Query with POI Preferences. 2021 26th Inte Conf Database Sys Adv Appl (DASFAA\u201921), 457-473","DOI":"10.1007\/978-3-030-73194-6_31"},{"issue":"4","key":"878_CR20","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1007\/s00778-006-0038-6","volume":"17","author":"M Sharifzadeh","year":"2008","unstructured":"Sharifzadeh M, Kolahdouzan M, Shahabi C (2008) The optimal sequenced route query. VLDB J 17(4):765\u2013787","journal-title":"VLDB J"},{"issue":"8","key":"878_CR21","doi-asserted-by":"publisher","first-page":"1693","DOI":"10.3724\/SP.J.1016.2013.01693","volume":"36","author":"XY Song","year":"2013","unstructured":"Song XY, Xu HF, Sun HL, Liu JL (2013) Short-term experience route search based on check-in data. Chi J Comput 36(8):1693\u20131703","journal-title":"Chi J Comput"},{"key":"878_CR22","doi-asserted-by":"crossref","unstructured":"Wang Y, Yuan Y, Wang H, Zhou X, Wang G (2021) Constrained Route Planning over Large Multi-Modal Time-Dependent Networks. 2021 IEEE 37th Int Conf Data Eng (ICDE\u201921), 313-324","DOI":"10.1109\/ICDE51399.2021.00034"},{"issue":"8","key":"878_CR23","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1109\/TKDE.2017.2690421","volume":"29","author":"YT Wen","year":"2017","unstructured":"Wen YT, Yeo J, Peng WC, Hwang SW (2017) Efficient keyword-aware representative travel route recommendation. IEEE Trans Knowl Data Eng 29(8):1639\u20131652","journal-title":"IEEE Trans Knowl Data Eng"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00878-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-022-00878-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00878-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,13]],"date-time":"2022-08-13T06:15:31Z","timestamp":1660371331000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-022-00878-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,6]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["878"],"URL":"https:\/\/doi.org\/10.1007\/s10878-022-00878-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2022,7,6]]},"assertion":[{"value":"20 June 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 July 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}