{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T15:52:01Z","timestamp":1769529121244,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":7,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,6,13]],"date-time":"2015-06-13T00:00:00Z","timestamp":1434153600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Natural Science Foundation of China","award":["61300025"],"award-info":[{"award-number":["61300025"]}]},{"DOI":"10.13039\/501100003392","name":"Natural Science Foundation of Fujian Province","doi-asserted-by":"publisher","award":["2012J05115"],"award-info":[{"award-number":["2012J05115"]}],"id":[{"id":"10.13039\/501100003392","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Doctoral Funds of Ministry of Education of China for Young Scholars","award":["20123514120013"],"award-info":[{"award-number":["20123514120013"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,6,13]]},"DOI":"10.1145\/2755573.2755608","type":"proceedings-article","created":{"date-parts":[[2015,6,12]],"date-time":"2015-06-12T18:43:54Z","timestamp":1434134634000},"page":"62-64","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Efficient Approximation Algorithms for Computing k Disjoint Restricted Shortest Paths"],"prefix":"10.1145","author":[{"given":"Longkun","family":"Guo","sequence":"first","affiliation":[{"name":"Fuzhou University, Fuzhou, China"}]},{"given":"Kewen","family":"Liao","sequence":"additional","affiliation":[{"name":"University of Melbourne, Melbourne, Australia"}]},{"given":"Hong","family":"Shen","sequence":"additional","affiliation":[{"name":"University of Adelaide, Adelaide, Australia"}]},{"given":"Peng","family":"Li","sequence":"additional","affiliation":[{"name":"Washington University in St. Louis, Saint Louis, MO, USA"}]}],"member":"320","published-online":{"date-parts":[[2015,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/578533"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-009-0297-2"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08016-1_9"},{"key":"e_1_3_2_1_4_1","unstructured":"L. Guo K. Liao H. Shen and P. Li. Efficient approximation algorithms for computing phk disjoint restricted shortest paths. http:\/\/arxiv.org\/abs\/1504.05519.  L. Guo K. Liao H. Shen and P. Li. Efficient approximation algorithms for computing phk disjoint restricted shortest paths. http:\/\/arxiv.org\/abs\/1504.05519."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-013-9693-x"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1354543"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1093\/ietisy\/e90-d.2.465"}],"event":{"name":"SPAA '15: 27th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Portland Oregon USA","acronym":"SPAA '15","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2755573.2755608","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2755573.2755608","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:17:05Z","timestamp":1750227425000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2755573.2755608"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,13]]},"references-count":7,"alternative-id":["10.1145\/2755573.2755608","10.1145\/2755573"],"URL":"https:\/\/doi.org\/10.1145\/2755573.2755608","relation":{},"subject":[],"published":{"date-parts":[[2015,6,13]]},"assertion":[{"value":"2015-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}