{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,12]],"date-time":"2025-05-12T18:10:03Z","timestamp":1747073403943,"version":"3.40.5"},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"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":["IEEE Trans. Parallel Distrib. Syst."],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1109\/tpds.2025.3563849","type":"journal-article","created":{"date-parts":[[2025,4,24]],"date-time":"2025-04-24T17:07:59Z","timestamp":1745514479000},"page":"1311-1325","source":"Crossref","is-referenced-by-count":0,"title":["Parallel Greedy Algorithms for Steiner Forest"],"prefix":"10.1109","volume":"36","author":[{"given":"Laleh","family":"Ghalami","sequence":"first","affiliation":[{"name":"Wayne State University, Detroit, MI, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2340-5433","authenticated-orcid":false,"given":"Daniel","family":"Grosu","sequence":"additional","affiliation":[{"name":"Wayne State University, Detroit, MI, USA"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792236237"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-59776-8_22"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2016.2546258"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2006.06.001"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3490148.3538555"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(89)90039-2"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10766-013-0243-z"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2935764.2935765"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2016.2634535"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/08072721X"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2008.06.046"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2014.45"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3409964.3461782"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/978-1-4757-3171-2","article-title":"Preprocessing the Steiner problem in graphs","volume-title":"Advances in Steiner Trees","author":"Du","year":"2000"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230170309"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3323165.3323206"},{"article-title":"Parallel greedy algorithms for Steiner forest","year":"2022","author":"Ghalami","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW55747.2022.00130"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1002\/net.22046"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793242618"},{"key":"ref21","first-page":"31:1","article-title":"A local-search algorithm for Steiner forest","volume-title":"Proc. 9th Innovations Theor. Comput. Sci. Conf.","author":"Gro\u00df"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746590"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238233"},{"volume-title":"The Steiner Tree Problem","year":"1992","author":"Hwang","key":"ref24"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/S0196-6774(03)00076-2"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btz110"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.5486\/PMD.1959.6.3-4.12"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700371065"},{"year":"2020","key":"ref30","article-title":"A collection of Steiner forest problems in graphs"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2012.0092"}],"container-title":["IEEE Transactions on Parallel and Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/71\/10969501\/10976340.pdf?arnumber=10976340","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,12]],"date-time":"2025-05-12T17:45:49Z","timestamp":1747071949000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10976340\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6]]},"references-count":31,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tpds.2025.3563849","relation":{},"ISSN":["1045-9219","1558-2183","2161-9883"],"issn-type":[{"type":"print","value":"1045-9219"},{"type":"electronic","value":"1558-2183"},{"type":"electronic","value":"2161-9883"}],"subject":[],"published":{"date-parts":[[2025,6]]}}}