{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T10:57:53Z","timestamp":1761649073496,"version":"3.37.3"},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T00:00:00Z","timestamp":1669852800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100002920","name":"Hong Kong Research Grants Council","doi-asserted-by":"publisher","award":["16202722"],"award-info":[{"award-number":["16202722"]}],"id":[{"id":"10.13039\/501100002920","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Jockey Club (JC) Science, Technology, Engineering, and Mathematics (STEM) Lab of Data Science Foundations funded by the Hong Kong Jockey Club Charities Trust"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Intell. Transport. Syst."],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1109\/tits.2022.3207499","type":"journal-article","created":{"date-parts":[[2022,9,29]],"date-time":"2022-09-29T19:40:50Z","timestamp":1664480450000},"page":"24031-24043","source":"Crossref","is-referenced-by-count":3,"title":["An Efficient Algorithm for Maximum Trajectory Coverage Query With Approximation Guarantee"],"prefix":"10.1109","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9064-566X","authenticated-orcid":false,"given":"Dan","family":"He","sequence":"first","affiliation":[{"name":"Faculty of Engineering, Architecture, and Information Technology, The University of Queensland, Brisbane, QLD, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Zhou","sequence":"additional","affiliation":[{"name":"Department of Computer Science, ETH Z&#x00FC;rich, Z&#x00FC;rich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6343-1455","authenticated-orcid":false,"given":"Xiaofang","family":"Zhou","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, The Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6380-3001","authenticated-orcid":false,"given":"Jiwon","family":"Kim","sequence":"additional","affiliation":[{"name":"Faculty of Engineering, Architecture, and Information Technology, The University of Queensland, Brisbane, QLD, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2020.3019373"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2019.12.004"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807197"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22922-0_14"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-22363-6_10"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2776268"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3397536.3422350"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-73194-6_44"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.3390\/info12050202"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"ref18","first-page":"395","article-title":"Novel approaches to the indexing of moving object trajectories","author":"pfoser","year":"2000","journal-title":"Proc VLDB"},{"key":"ref19","first-page":"223","article-title":"Efficient historical R-trees","author":"tao","year":"2001","journal-title":"Proc 13th Int Conf Sci Stat Database Manage (SSDBM)"},{"journal-title":"A guide for planning and operating flexible public transportation services","year":"2010","author":"potts","key":"ref28"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1978.1"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.14778\/2904121.2904122"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1061\/(ASCE)0733-947X(2009)135:8(491)"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.2172\/4785039"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2019.02.006"},{"key":"ref5","first-page":"498","article-title":"Guarantees for greedy maximization of non-submodular functions with applications","volume":"70","author":"bian","year":"2017","journal-title":"Proc 34th Int Conf Mach Learn"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196913"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68552-4_24"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1520-6750(199809)45:6<615::AID-NAV5>3.0.CO;2-5"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.14778\/3291264.3291266"},{"key":"ref9","first-page":"247","article-title":"A performance study on large-scale data analytics using disk-based and in-memory database systems","author":"chao","year":"2017","journal-title":"Proc IEEE Int Conf Big Data Smart Comput (BigComp)"},{"key":"ref20","first-page":"431","article-title":"MV3R-tree: A spatio-temporal access method for timestamp and interval queries","author":"tao","year":"2001","journal-title":"Proc Int Conf Very Large Data Bases"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/261342.571216"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/MDM.2008.24"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.06.026"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2001.1183"},{"key":"ref26","article-title":"A note on max k-vertex cover: Faster FPT-AS, smaller approximate kernel and improved approximation","author":"manurangsi","year":"2018","journal-title":"arXiv 1810 03792"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00020"}],"container-title":["IEEE Transactions on Intelligent Transportation Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6979\/9972869\/09905740.pdf?arnumber=9905740","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,26]],"date-time":"2022-12-26T19:25:14Z","timestamp":1672082714000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9905740\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12]]},"references-count":31,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tits.2022.3207499","relation":{},"ISSN":["1524-9050","1558-0016"],"issn-type":[{"type":"print","value":"1524-9050"},{"type":"electronic","value":"1558-0016"}],"subject":[],"published":{"date-parts":[[2022,12]]}}}