{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T11:23:26Z","timestamp":1774610606219,"version":"3.50.1"},"reference-count":49,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"crossref","award":["2017YFC0803700"],"award-info":[{"award-number":["2017YFC0803700"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"crossref","award":["2016YFB1000905"],"award-info":[{"award-number":["2016YFB1000905"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["61370101"],"award-info":[{"award-number":["61370101"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["61532021"],"award-info":[{"award-number":["61532021"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["U1501252"],"award-info":[{"award-number":["U1501252"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["61702423"],"award-info":[{"award-number":["61702423"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["61772327"],"award-info":[{"award-number":["61772327"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2018,3,1]]},"DOI":"10.1109\/tkde.2017.2773492","type":"journal-article","created":{"date-parts":[[2017,11,14]],"date-time":"2017-11-14T19:10:47Z","timestamp":1510686647000},"page":"488-502","source":"Crossref","is-referenced-by-count":107,"title":["Finding Top-k Shortest Paths with Diversity"],"prefix":"10.1109","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7231-8905","authenticated-orcid":false,"given":"Huiping","family":"Liu","sequence":"first","affiliation":[]},{"given":"Cheqing","family":"Jin","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1658-1079","authenticated-orcid":false,"given":"Bin","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Aoying","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767846"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2015.01.019"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1038\/234034a0"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230120406"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.14778\/2536258.2536272"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1290672.1290682"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.14778\/2350229.2350233"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2009916.2009996"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-32049-6_25"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s12205-010-0061-4"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113389"},{"key":"ref29","first-page":"53","article-title":"Finding diverse shortest paths for the routing task in wireless sensor networks","author":"henao-mazo","year":"2012","journal-title":"Proc Int Conf Commun Syst Netw"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00214-3"},{"key":"ref1","year":"0"},{"key":"ref20","first-page":"539","article-title":"Hazardous materials transportation","volume":"14","author":"erkut","year":"2007","journal-title":"Handbook in OR and MS"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.14778\/2536258.2536263"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1287\/opre.46.5.625"},{"key":"ref24","first-page":"156","article-title":"Computing the shortest path: A search meets graph theory","author":"goldberg","year":"2003","journal-title":"Proc 12th Annu ACM-SIAM Symp Discrete Algorithms"},{"key":"ref23","volume":"207","author":"godsil","year":"2013","journal-title":"Algebraic Graph Theory"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2694428.2694432"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376708"},{"key":"ref10","first-page":"133","article-title":"Efficiently computing top-k shortest path join","author":"chang","year":"2015","journal-title":"Proc Intl Conf Extending Database Technology"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICUMT.2013.6798403"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7139774"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2820783.2820858"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113313"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.14778\/3021924.3021926"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1835449.1835506"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.14778\/2536354.2536358"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1860702.1860709"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365697"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MDM.2013.50"},{"key":"ref3","first-page":"2","article-title":"Efficient top-k shortest-path distance queries on large networks\n by pruned landmark labeling","author":"akiba","year":"2015","journal-title":"Proc 26th AAAI Conf Artif Intell"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49487-6_2"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989405"},{"key":"ref8","author":"cahn","year":"1998","journal-title":"Wide Area Network Design Concepts and Tools for Optimization"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2213556.2213580"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-017-0470-0"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.06.003"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113300"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.17.11.712"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2662236"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/s41019-016-0013-1"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.14778\/2536360.2536375"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-017-0491-4"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-015-0378-1"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816646"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/8280528\/08107512.pdf?arnumber=8107512","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:26:23Z","timestamp":1642004783000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8107512\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,1]]},"references-count":49,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2017.2773492","relation":{},"ISSN":["1041-4347"],"issn-type":[{"value":"1041-4347","type":"print"}],"subject":[],"published":{"date-parts":[[2018,3,1]]}}}