{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:07:35Z","timestamp":1750306055245,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,5,19]],"date-time":"2017-05-19T00:00:00Z","timestamp":1495152000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,5,19]]},"DOI":"10.1145\/3078447.3078460","type":"proceedings-article","created":{"date-parts":[[2017,6,5]],"date-time":"2017-06-05T12:50:05Z","timestamp":1496667005000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Finding Top K Shortest Simple Paths with Improved Space Efficiency"],"prefix":"10.1145","author":[{"given":"Qingsong","family":"Wen","sequence":"first","affiliation":[{"name":"Huawei Research America, Santa Clara, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ren","family":"Chen","sequence":"additional","affiliation":[{"name":"Huawei Research America, Santa Clara, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lifeng","family":"Nai","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Zhou","sequence":"additional","affiliation":[{"name":"The Ohio State University, Columbus, OH, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinglong","family":"Xia","sequence":"additional","affiliation":[{"name":"Huawei Research America, Santa Clara, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,5,19]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"2006. Ninth DIMACS Implementation Challenge-Shortest Paths. (2006). http:\/\/www.dis.uniromal.it\/challenge9\/  2006. Ninth DIMACS Implementation Challenge-Shortest Paths. (2006). http:\/\/www.dis.uniromal.it\/challenge9\/"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/FCCM.2016.62"},{"key":"e_1_3_2_1_3_1","volume-title":"Marta Margarida Braz Pascoal, and Jos\u00e9 Luis Esteves Dos Santos","author":"Queir\u00f3s Vieira Martins Ernesto De","year":"1997","unstructured":"Ernesto De Queir\u00f3s Vieira Martins , Marta Margarida Braz Pascoal, and Jos\u00e9 Luis Esteves Dos Santos . 1997 . A new algorithm for ranking loopless paths. Research Report, CISUC ( 1997). Ernesto De Queir\u00f3s Vieira Martins, Marta Margarida Braz Pascoal, and Jos\u00e9 Luis Esteves Dos Santos. 1997. A new algorithm for ranking loopless paths. Research Report, CISUC (1997)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054199000186"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795290477"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2013.136"},{"key":"e_1_3_2_1_8_1","first-page":"B263","article-title":"K-th shortest paths and applications to probabilistic networks","volume":"23","author":"Fox BL","year":"1975","unstructured":"BL Fox . 1975 . K-th shortest paths and applications to probabilistic networks . In Operations Research , Vol. 23. B263 -- B263 . BL Fox. 1975. K-th shortest paths and applications to probabilistic networks. In Operations Research, Vol. 23. B263--B263.","journal-title":"Operations Research"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1290672.1290682"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/320998.321004"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230120406"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2807591.2807626"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250746"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ReConFig.2015.7393322"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2621934.2621945"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2013.6638619"},{"key":"e_1_3_2_1_17_1","volume-title":"Finding the k shortest loopless paths in a network. management Science 17, 11","author":"Yen Jin Y","year":"1971","unstructured":"Jin Y Yen . 1971. Finding the k shortest loopless paths in a network. management Science 17, 11 ( 1971 ), 712--716. Jin Y Yen. 1971. Finding the k shortest loopless paths in a network. management Science 17, 11 (1971), 712--716."}],"event":{"name":"SIGMOD\/PODS'17: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Chicago IL USA","acronym":"SIGMOD\/PODS'17"},"container-title":["Proceedings of the Fifth International Workshop on Graph Data-management Experiences & Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3078447.3078460","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3078447.3078460","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:03:33Z","timestamp":1750215813000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3078447.3078460"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,19]]},"references-count":17,"alternative-id":["10.1145\/3078447.3078460","10.1145\/3078447"],"URL":"https:\/\/doi.org\/10.1145\/3078447.3078460","relation":{},"subject":[],"published":{"date-parts":[[2017,5,19]]},"assertion":[{"value":"2017-05-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}