{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T18:16:56Z","timestamp":1730225816978,"version":"3.28.0"},"reference-count":22,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T00:00:00Z","timestamp":1695600000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,9,25]],"date-time":"2023-09-25T00:00:00Z","timestamp":1695600000000},"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":[[2023,9,25]]},"DOI":"10.1109\/hpec58863.2023.10363452","type":"proceedings-article","created":{"date-parts":[[2023,12,25]],"date-time":"2023-12-25T19:39:57Z","timestamp":1703533197000},"page":"1-7","source":"Crossref","is-referenced-by-count":0,"title":["A GPU Parallel Algorithm for Finding a Negative Subset Disjoint Cycle in a Graph"],"prefix":"10.1109","author":[{"given":"Piotr","family":"Sielski","sequence":"first","affiliation":[{"name":"NVIDIA"}]},{"given":"Akif","family":"\u00c7\u00f6rd\u00fck","sequence":"additional","affiliation":[{"name":"NVIDIA"}]},{"given":"Hugo","family":"Linsenmaier","sequence":"additional","affiliation":[{"name":"NVIDIA"}]},{"given":"Alex","family":"Fender","sequence":"additional","affiliation":[{"name":"NVIDIA"}]}],"member":"263","reference":[{"key":"ref1","article-title":"New neighborhood search structures for the capacitated minimum spanning tree problem","volume-title":"Techn. Report Sloan School Management","author":"Ahuja","year":"1998"},{"key":"ref2","volume":"91","author":"Ravindra","year":"2001","journal-title":"Multi-Exchange Neighborhood Structures for the Capacitated Minimum Spanning Tree Problem. Mathematical Programming, Series B"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(02)00236-5"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.21236\/ada594171"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2006.03.002"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.2022.1176"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-006-0029-x"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2017.1595"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-018-9372-2"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2716282.2716287"},{"journal-title":"Rafal Skinderowicz Implementing a GPU-based parallel MAX-MIN Ant System Author links open overlay panel","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/tc.2011.206"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s13676-013-0026-0"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/hpec55821.2022.9926363"},{"volume-title":"The art of computer programming","year":"1997","author":"Knuth","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/355900.355919"},{"volume-title":"Algorithms in C++, Parts 1\u20134: Fundamentals, Data Structure, Sorting, Searching","year":"1998","author":"Sedgewick","key":"ref17"},{"volume-title":"Sintef, Li & Lim benchmark Top List","key":"ref18"},{"key":"ref19","article-title":"The theory of cyclic transfers. Working Paper OR200\u201389","volume-title":"Operations Research Center","author":"Thompson","year":"1989"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1287\/opre.41.5.935"},{"volume-title":"RAPIDS Memory Manager","key":"ref21"},{"volume-title":"Nvidia CUB","key":"ref22"}],"event":{"name":"2023 IEEE High Performance Extreme Computing Conference (HPEC)","start":{"date-parts":[[2023,9,25]]},"location":"Boston, MA, USA","end":{"date-parts":[[2023,9,29]]}},"container-title":["2023 IEEE High Performance Extreme Computing Conference (HPEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10363430\/10363422\/10363452.pdf?arnumber=10363452","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T22:47:45Z","timestamp":1705099665000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10363452\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,25]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/hpec58863.2023.10363452","relation":{},"subject":[],"published":{"date-parts":[[2023,9,25]]}}}