{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T09:24:03Z","timestamp":1773998643915,"version":"3.50.1"},"reference-count":12,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,12,8]]},"DOI":"10.1109\/globecom59602.2025.11431968","type":"proceedings-article","created":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T20:04:01Z","timestamp":1773950641000},"page":"3837-3842","source":"Crossref","is-referenced-by-count":0,"title":["A Dual-Queue Asynchronous Parallel Algorithm for Multicriteria Optimal Path Computation"],"prefix":"10.1109","author":[{"given":"Xiaoqing","family":"Xu","sequence":"first","affiliation":[{"name":"China Telecom Research Institute,Guangzhou,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ning","family":"Zhang","sequence":"additional","affiliation":[{"name":"China Telecom Research Institute,Guangzhou,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan","family":"Wu","sequence":"additional","affiliation":[{"name":"China Telecom Research Institute,Guangzhou,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaojun","family":"Liu","sequence":"additional","affiliation":[{"name":"China Telecom Research Institute,Guangzhou,China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong","family":"Tang","sequence":"additional","affiliation":[{"name":"China Telecom Research Institute,Guangzhou,China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2010.05.017"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-46618-2_15"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICNP.2015.36"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-005-0074-x"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2015.05.007"},{"key":"ref6","article-title":"Multi-objective search via lazy and efficient dominance checks","volume-title":"International Joint Conference on Artificial Intelligence (IJCAI)","author":"Hern\u00e1ndez"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(84)90077-8"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1023\/A:1012602011914"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2024.104260"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2013.89"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3084096"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/964725.633039"}],"event":{"name":"GLOBECOM 2025 - 2025 IEEE Global Communications Conference","location":"Taipei, Taiwan","start":{"date-parts":[[2025,12,8]]},"end":{"date-parts":[[2025,12,12]]}},"container-title":["GLOBECOM 2025 - 2025 IEEE Global Communications Conference"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11431620\/11431622\/11431968.pdf?arnumber=11431968","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T05:43:27Z","timestamp":1773985407000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11431968\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,8]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/globecom59602.2025.11431968","relation":{},"subject":[],"published":{"date-parts":[[2025,12,8]]}}}