{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T18:50:23Z","timestamp":1766602223002,"version":"3.48.0"},"reference-count":36,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,5,2]],"date-time":"2022-05-02T00:00:00Z","timestamp":1651449600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,5,2]],"date-time":"2022-05-02T00:00:00Z","timestamp":1651449600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100005153","name":"China National Funds for Distinguished Young Scientists","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005153","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,5,2]]},"DOI":"10.1109\/infocom48880.2022.9796817","type":"proceedings-article","created":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T17:18:49Z","timestamp":1655745529000},"page":"1599-1608","source":"Crossref","is-referenced-by-count":2,"title":["ANTIGONE: Accurate Navigation Path Caching in Dynamic Road Networks leveraging Route APIs"],"prefix":"10.1109","author":[{"given":"Xiaojing","family":"Yu","sequence":"first","affiliation":[{"name":"University of Science and Technology of China,School of Computer Science and Technology, the CAS Key Laboratory of Wireless-Optical Communications,Hefei,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiang-Yang","family":"Li","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China,School of Computer Science and Technology, the CAS Key Laboratory of Wireless-Optical Communications,Hefei,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"Zhao","sequence":"additional","affiliation":[{"name":"Alibaba Group,Shanghai,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guobin","family":"Shen","sequence":"additional","affiliation":[{"name":"Alibaba Group,Shanghai,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikolaos M.","family":"Freris","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China,School of Computer Science and Technology, the CAS Key Laboratory of Wireless-Optical Communications,Hefei,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lan","family":"Zhang","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China,School of Computer Science and Technology, the CAS Key Laboratory of Wireless-Optical Communications,Hefei,China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.14778\/2732939.2732940"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/MDM.2015.77"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.3233\/IDA-2007-11508"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623656"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s10707-016-0288-4"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-008-0132-8"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s10707-020-00406-x"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767890"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1653771.1653776"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/MPRV.2006.83"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3068335"},{"key":"ref14","first-page":"2527","article-title":"Compressed k-means for large-scale clustering","author":"shen","year":"2017","journal-title":"Thirty-First AAAI Conference on Artificial Intelligence"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BFb0121195","article-title":"An analysis of approximations for maximizing submodular set functionsII","author":"fisher","year":"1978","journal-title":"Polyhedral Combinatorics"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1177\/0361198105191700107"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1609\/aaai.v26i1.8279","article-title":"Knapsack based optimal policies for budget–limited multi–armed bandits","volume":"26","author":"tran-thanh","year":"2012","journal-title":"Proceedings of the AAAI Conference on Artificial Intelligence"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155518"},{"key":"ref28","article-title":"Hierarchical graph clustering using node pair sampling","author":"bonald","year":"2018","journal-title":"International Workshop on Mining and Learning with Graphs (MLG)"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2324597"},{"key":"ref27","first-page":"19","article-title":"Using random subsets to build scalable network services","author":"kostic","year":"2003","journal-title":"USENIX Symposium on Internet Technologies and Systems"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10619-012-7110-6"},{"key":"ref6","first-page":"389","article-title":"LHD: Improving cache hit rate by maximizing hit density","author":"beckmann","year":"2018","journal-title":"Proceedings of the 15th USENIX Symposium on Networked Systems Design and Implementation (NSDI)"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.3390\/ijgi6120400"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2507581"},{"journal-title":"Introduction to Algorithms","year":"2009","author":"cormen","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213872"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-018-0549-2"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2017.06.001"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219900"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.2019.0920","article-title":"Sparse travel time estimation from streaming data","volume":"54","author":"jabari","year":"2020","journal-title":"Transportation Science"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2014.2343914"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ITSC.2016.7795686"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.3390\/s18092892"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403307"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2006.01.013"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2743025"}],"event":{"name":"IEEE INFOCOM 2022 - IEEE Conference on Computer Communications","start":{"date-parts":[[2022,5,2]]},"location":"London, United Kingdom","end":{"date-parts":[[2022,5,5]]}},"container-title":["IEEE INFOCOM 2022 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9796607\/9796652\/09796817.pdf?arnumber=9796817","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T18:44:35Z","timestamp":1766601875000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9796817\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,2]]},"references-count":36,"URL":"https:\/\/doi.org\/10.1109\/infocom48880.2022.9796817","relation":{},"subject":[],"published":{"date-parts":[[2022,5,2]]}}}