Parallel Greedy Algorithms for Steiner Forest

The Steiner Forest Problem is a fundamental combinatorial optimization problem in operations research and computer science. Given an undirected graph with non-negative weights for edges and a set of pairs of vertices called terminals, the Steiner Forest Problem is to find the minimum cost subgraph t...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on parallel and distributed systems Jg. 36; H. 6; S. 1311 - 1325
Hauptverfasser: Ghalami, Laleh, Grosu, Daniel
Format: Journal Article
Sprache:Englisch
Veröffentlicht: IEEE 01.06.2025
Schlagworte:
Approximation algorithms
Costs
Forestry
Greedy algorithms
Libraries
multi-core
Optimization
Parallel algorithms
Partitioning algorithms
Steiner forest
Steiner trees
Training
ISSN:1045-9219, 1558-2183
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract The Steiner Forest Problem is a fundamental combinatorial optimization problem in operations research and computer science. Given an undirected graph with non-negative weights for edges and a set of pairs of vertices called terminals, the Steiner Forest Problem is to find the minimum cost subgraph that connects each of the terminal pairs together. We design a family of parallel greedy algorithms based on a sequential heuristic greedy algorithm called Paired Greedy, which iteratively connects the terminal pairs that have the minimum distance. The family of parallel algorithms consists of a set of algorithms exhibiting various degrees of parallelism determined by the number of pairs that are connected in parallel in each iteration of the algorithms. We implement and run the algorithms on a multi-core system and perform an extensive experimental analysis. We analyzed the performance of the algorithms on a rich library of Steiner Forest instances with various underlying graph types. The results show that our proposed parallel algorithms achieve significant speedup with respect to the sequential Paired Greedy algorithm and provide solutions with costs that are very close to those of the solutions obtained by the sequential Paired Greedy algorithm. We provide recommendation on selecting the type of parallel algorithm and its parameters in order to achieve the most efficient results for each class of instances.
AbstractList The Steiner Forest Problem is a fundamental combinatorial optimization problem in operations research and computer science. Given an undirected graph with non-negative weights for edges and a set of pairs of vertices called terminals, the Steiner Forest Problem is to find the minimum cost subgraph that connects each of the terminal pairs together. We design a family of parallel greedy algorithms based on a sequential heuristic greedy algorithm called Paired Greedy, which iteratively connects the terminal pairs that have the minimum distance. The family of parallel algorithms consists of a set of algorithms exhibiting various degrees of parallelism determined by the number of pairs that are connected in parallel in each iteration of the algorithms. We implement and run the algorithms on a multi-core system and perform an extensive experimental analysis. We analyzed the performance of the algorithms on a rich library of Steiner Forest instances with various underlying graph types. The results show that our proposed parallel algorithms achieve significant speedup with respect to the sequential Paired Greedy algorithm and provide solutions with costs that are very close to those of the solutions obtained by the sequential Paired Greedy algorithm. We provide recommendation on selecting the type of parallel algorithm and its parameters in order to achieve the most efficient results for each class of instances.
Author Ghalami, Laleh
Grosu, Daniel
Author_xml – sequence: 1
  givenname: Laleh
  surname: Ghalami
  fullname: Ghalami, Laleh
  email: lghalami@wayne.edu
  organization: Wayne State University, Detroit, MI, USA
– sequence: 2
  givenname: Daniel
  orcidid: 0000-0003-2340-5433
  surname: Grosu
  fullname: Grosu, Daniel
  email: dgrosu@wayne.edu
  organization: Wayne State University, Detroit, MI, USA
BookMark eNpNj81Kw0AUhQepYFt9AMFFXmDivfOTzCxLtVUoWGhdD2lmrkbSRGay6dvb0C5cnbM434FvxiZd3wXGHhFyRLDP--3LLhcgdC51IY2yN2yKWhsu0MjJuYPS3Aq0d2yW0g8AKg1qyvi2ilXbhjZbxxD8KVu0X31shu9jyqiP2W4ITRditupjSMM9u6WqTeHhmnP2uXrdL9_45mP9vlxseC0EDNx48iQsygJIWQChSJSGQFcSyRqFVCORKEpd-9JTqQ4oPXqPIA5YGCXnDC-_dexTioHcb2yOVTw5BDf6utHXjb7u6ntmni5ME0L4t7dlIRXIP-8gUjw
CODEN ITDSEO
Cites_doi 10.1137/08072721X
10.1109/TPDS.2016.2634535
10.1137/S0097539793242618
10.1109/SFCS.2003.1238233
10.1109/TPDS.2016.2546258
10.1016/0020-0190(89)90039-2
10.1016/j.jpdc.2006.06.001
10.1109/IPDPSW55747.2022.00130
10.1145/3323165.3323206
10.1007/978-1-4684-2001-2_9
10.1007/s10766-013-0243-z
10.1016/j.tcs.2008.06.046
10.1002/net.3230170309
10.5486/PMD.1959.6.3-4.12
10.1089/cmb.2012.0092
10.1137/S0097539700371065
10.1145/3409964.3461782
10.1145/2935764.2935765
10.1109/IPDPS.2014.45
10.1007/978-3-319-59776-8_22
10.1007/978-1-4757-3171-2
10.1093/bioinformatics/btz110
10.1137/S0097539792236237
10.1145/2746539.2746590
10.1016/S0196-6774(03)00076-2
10.1002/net.22046
10.1145/3490148.3538555
ContentType Journal Article
DBID 97E
RIA
RIE
AAYXX
CITATION
DOI 10.1109/TPDS.2025.3563849
DatabaseName IEEE Xplore (IEEE)
IEEE All-Society Periodicals Package (ASPP) 1998-Present
IEEE Electronic Library (IEL)
CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Forestry
Computer Science
EISSN 1558-2183
EndPage 1325
ExternalDocumentID 10_1109_TPDS_2025_3563849
10976340
Genre orig-research
GroupedDBID --Z
-~X
.DC
0R~
29I
4.4
5GY
5VS
6IK
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABFSI
ABQJQ
ABVLG
ACGFO
ACIWK
AENEX
AETIX
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
AKJIK
AKQYR
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ASUFR
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
E.L
EBS
EJD
HZ~
H~9
ICLAB
IEDLZ
IFIPE
IFJZH
IPLJI
JAVBF
LAI
M43
MS~
O9-
OCL
P2P
PQQKQ
RIA
RIE
RNI
RNS
RZB
TN5
TWZ
UHB
VH1
AAYXX
CITATION
ID FETCH-LOGICAL-c220t-8dfdf291360f490024f278f05a31f9841fc1ff2675cd7df74b13d1dd102b16843
IEDL.DBID RIE
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001484662000001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1045-9219
IngestDate Sat Nov 29 07:56:16 EST 2025
Wed Aug 27 01:53:09 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 6
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
https://doi.org/10.15223/policy-029
https://doi.org/10.15223/policy-037
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c220t-8dfdf291360f490024f278f05a31f9841fc1ff2675cd7df74b13d1dd102b16843
ORCID 0000-0003-2340-5433
PageCount 15
ParticipantIDs crossref_primary_10_1109_TPDS_2025_3563849
ieee_primary_10976340
PublicationCentury 2000
PublicationDate 2025-06-01
PublicationDateYYYYMMDD 2025-06-01
PublicationDate_xml – month: 06
  year: 2025
  text: 2025-06-01
  day: 01
PublicationDecade 2020
PublicationTitle IEEE transactions on parallel and distributed systems
PublicationTitleAbbrev TPDS
PublicationYear 2025
Publisher IEEE
Publisher_xml – name: IEEE
References ref13
ref12
ref15
ref31
ref11
ref10
ref2
ref1
Groß (ref21)
ref16
ref19
ref18
Ghalami (ref17) 2022
ref23
ref26
ref25
ref20
ref22
ref28
ref27
ref29
ref8
ref7
ref9
ref4
Hwang (ref24) 1992
(ref30) 2020
ref3
ref6
ref5
Du (ref14) 2000
References_xml – ident: ref10
  doi: 10.1137/08072721X
– volume-title: The Steiner Tree Problem
  year: 1992
  ident: ref24
– ident: ref9
  doi: 10.1109/TPDS.2016.2634535
– ident: ref20
  doi: 10.1137/S0097539793242618
– ident: ref23
  doi: 10.1109/SFCS.2003.1238233
– ident: ref3
  doi: 10.1109/TPDS.2016.2546258
– ident: ref6
  doi: 10.1016/0020-0190(89)90039-2
– ident: ref4
  doi: 10.1016/j.jpdc.2006.06.001
– start-page: 31:1
  volume-title: Proc. 9th Innovations Theor. Comput. Sci. Conf.
  ident: ref21
  article-title: A local-search algorithm for Steiner forest
– ident: ref18
  doi: 10.1109/IPDPSW55747.2022.00130
– ident: ref16
  doi: 10.1145/3323165.3323206
– ident: ref25
  doi: 10.1007/978-1-4684-2001-2_9
– ident: ref7
  doi: 10.1007/s10766-013-0243-z
– ident: ref11
  doi: 10.1016/j.tcs.2008.06.046
– ident: ref15
  doi: 10.1002/net.3230170309
– ident: ref28
  doi: 10.5486/PMD.1959.6.3-4.12
– ident: ref31
  doi: 10.1089/cmb.2012.0092
– ident: ref29
  doi: 10.1137/S0097539700371065
– ident: ref13
  doi: 10.1145/3409964.3461782
– ident: ref8
  doi: 10.1145/2935764.2935765
– ident: ref12
  doi: 10.1109/IPDPS.2014.45
– ident: ref2
  doi: 10.1007/978-3-319-59776-8_22
– start-page: 175
  volume-title: Advances in Steiner Trees
  year: 2000
  ident: ref14
  article-title: Preprocessing the Steiner problem in graphs
  doi: 10.1007/978-1-4757-3171-2
– ident: ref27
  doi: 10.1093/bioinformatics/btz110
– ident: ref1
  doi: 10.1137/S0097539792236237
– ident: ref22
  doi: 10.1145/2746539.2746590
– ident: ref26
  doi: 10.1016/S0196-6774(03)00076-2
– ident: ref19
  doi: 10.1002/net.22046
– year: 2022
  ident: ref17
  article-title: Parallel greedy algorithms for Steiner forest
– year: 2020
  ident: ref30
  article-title: A collection of Steiner forest problems in graphs
– ident: ref5
  doi: 10.1145/3490148.3538555
SSID ssj0014504
Score 2.4509444
Snippet The Steiner Forest Problem is a fundamental combinatorial optimization problem in operations research and computer science. Given an undirected graph with...
SourceID crossref
ieee
SourceType Index Database
Publisher
StartPage 1311
SubjectTerms Approximation algorithms
Costs
Forestry
Greedy algorithms
Libraries
multi-core
Optimization
Parallel algorithms
Partitioning algorithms
Steiner forest
Steiner trees
Training
Title Parallel Greedy Algorithms for Steiner Forest
URI https://ieeexplore.ieee.org/document/10976340
Volume 36
WOSCitedRecordID wos001484662000001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE Electronic Library (IEL)
  customDbUrl:
  eissn: 1558-2183
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0014504
  issn: 1045-9219
  databaseCode: RIE
  dateStart: 19900101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEB60iOjBaq1YX-TgSdg2-0g2eyxq8SCl0Cq9hWQfWqiNpKngv3c3SSUXD97CklnCN9nMTObxAdwqySVWVgPCNwyxVEQoDYlB1Lq6hEmpKy6C12c-HkfzuZjUzeplL4zWuiw-0313WebyVSY37lfZwGVLQ8pshL7LeVg1a_2mDFhQcgXa8CJAwp7DOoVpZQazycPUhoIk6NPAvm9ubmbDCDVYVUqjMmr_83GO4aj2Hr1hpe4T2NGrDrS3zAxefVA7cNgYM9iBfce_6UjdTgFNktyxpyw9V3Cjvr3h8i3LF8X7x9qz7qs3deSXdqdKogsvo8fZ_ROqGROQJMQvUKSMMkRgGlrkhbO_hvDI-EFCsRERw0ZiY4gNEqTiynCWYqqwUtbLSHEYMXoGrVW20ufgGV_5oVQhl1wxLomQ1OjEfiB0EkgaJD2420IYf1aDMeIyoPBF7PCOHd5xjXcPug6-xo0Vchd_rF_CgROvSrKuoFXkG30Ne_KrWKzzm1LvP6CSqbE
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1JS8NAFH6IisvBaq1Y1xw8CWkzW5I5FrVUrKXQKr2FZBYt1FbSVPDfO5OkkosHbyFkhvDNTN778pYP4EaKQCBpVoB7mro04aGb-Fi7xLi6mAqhCi2C134wGISTCR-Wxep5LYxSKk8-Uy17mcfy5UKs7K-yto2W-oQahr7FKMVeUa71GzSgLFcLNASDudycxDKIaUa1x8P7kSGDmLUIMzvOds6smKGKrkpuVrq1f77QIRyU_qPTKRb8CDbUvA61tTaDUx7VOuxXGg3WYccqcFpZt2Nwh3Fq9VNmjk25kd9OZ_a2SKfZ-8fSMQ6sM7Lyl2amYkQDXroP47ueW2omuAJjL3NDqaXGHBHfYM-tBdY4CLXHYoI0DynSAmmNDU0QMpA6oAkiEklp_IwE-SElJ7A5X8zVKTjak54vpB-IQNJAYC6IVrH5RKiYCcLiJtyuIYw-i9YYUU4pPB5ZvCOLd1Ti3YSGha_yYIHc2R_3r2G3N37uR_3HwdM57NmpigStC9jM0pW6hG3xlU2X6VW-B34ApqOs-A
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Parallel+Greedy+Algorithms+for+Steiner+Forest&rft.jtitle=IEEE+transactions+on+parallel+and+distributed+systems&rft.au=Ghalami%2C+Laleh&rft.au=Grosu%2C+Daniel&rft.date=2025-06-01&rft.pub=IEEE&rft.issn=1045-9219&rft.volume=36&rft.issue=6&rft.spage=1311&rft.epage=1325&rft_id=info:doi/10.1109%2FTPDS.2025.3563849&rft.externalDocID=10976340
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1045-9219&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1045-9219&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1045-9219&client=summon