{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T03:01:29Z","timestamp":1784516489377,"version":"3.55.0"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T00:00:00Z","timestamp":1784505600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T00:00:00Z","timestamp":1784505600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"DOI":"10.1007\/s11227-026-08698-w","type":"journal-article","created":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T02:03:58Z","timestamp":1784513038000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A new broadcast model for several network topologies"],"prefix":"10.1007","volume":"82","author":[{"given":"Hongbo","family":"Lu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Junsung","family":"Hwang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bernard","family":"Tenreiro","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nabila Jaman","family":"Tripti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Darren","family":"Hamilton","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuefan","family":"Deng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,20]]},"reference":[{"key":"8698_CR1","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1007\/s11227-025-07281-z","volume":"81","author":"F Almeida","year":"2025","unstructured":"Almeida F, Okon E (2025) Assessing the impact of high-performance computing on digital transformation: benefits, challenges, and size-dependent differences. J Supercomput 81:795. https:\/\/doi.org\/10.1007\/s11227-025-07281-z","journal-title":"J Supercomput"},{"key":"8698_CR2","doi-asserted-by":"publisher","unstructured":"Jia W, Wang H, Chen M, Lu D, Lin L, Car R, Weinan E, Zhang L (2020) Pushing the limit of molecular dynamics with ab initio accuracy to 100 million atoms with machine learning. In: SC20: International Conference for High Performance Computing, Networking, Storage and Analysis, 1\u201314. https:\/\/doi.org\/10.1109\/SC41405.2020.00009","DOI":"10.1109\/SC41405.2020.00009"},{"issue":"5","key":"8698_CR3","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1177\/10943420231183688","volume":"37","author":"J Watkins","year":"2023","unstructured":"Watkins J, Carlson M, Shan K, Tezaur I, Perego M, Bertagna L, Kao C, Hoffman MJ, Price SF (2023) Performance portable ice-sheet modeling with mali. Int J High Perform Comput Appl 37(5):600\u2013625. https:\/\/doi.org\/10.1177\/10943420231183688","journal-title":"Int J High Perform Comput Appl"},{"issue":"6","key":"8698_CR4","doi-asserted-by":"publisher","first-page":"1632","DOI":"10.1021\/ct9000685","volume":"5","author":"MJ Harvey","year":"2009","unstructured":"Harvey MJ, Giupponi G, Fabritiis GD (2009) Acemd: accelerating biomolecular dynamics in the microsecond time scale. J Chem Theory Comput 5(6):1632\u20131639. https:\/\/doi.org\/10.1021\/ct9000685. (PMID: 26609855)","journal-title":"J Chem Theory Comput"},{"key":"8698_CR5","doi-asserted-by":"publisher","DOI":"10.3390\/app10196717","author":"J Woo","year":"2020","unstructured":"Woo J, Choi H, Lee J (2020) Empirical performance analysis of collective communication for distributed deep learning in a many-core cpu environment. Appl Sci. https:\/\/doi.org\/10.3390\/app10196717","journal-title":"Appl Sci"},{"key":"8698_CR6","volume-title":"Fast collective communication libraries, please","author":"P Mitra","year":"1995","unstructured":"Mitra P, Payne D, Shuler L, Geijn R, Watts J (1995) Fast collective communication libraries, please. Technical report, USA"},{"key":"8698_CR7","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1007\/11549468_87","volume-title":"Euro-Par 2005 Parallel Processing","author":"M Eleftheriou","year":"2005","unstructured":"Eleftheriou M, Fitch B, Rayshubskiy A, Ward TJC, Germain R (2005) Performance measurements of the 3d fft on the blue gene\/l supercomputer. In: Cunha JC, Medeiros PD (eds) Euro-Par 2005 Parallel Processing. Springer, Berlin, Heidelberg, pp 795\u2013803"},{"key":"8698_CR8","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1002\/cpe.728","volume":"15","author":"JJ Dongarra","year":"2003","unstructured":"Dongarra JJ, Luszczek P, Petitet A (2003) The LINPACK benchmark: past, present and future. Concurr Comput Pr Exp 15:803\u2013820. https:\/\/doi.org\/10.1002\/cpe.728","journal-title":"Concurr Comput Pr Exp"},{"key":"8698_CR9","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.simpat.2015.03.005","volume":"58","author":"K Hasanov","year":"2015","unstructured":"Hasanov K, Quintin J-N, Lastovetsky A (2015) Topology-oblivious optimization of mpi broadcast algorithms on extreme-scale platforms. Simul Model Pract Theory 58:30\u201339. https:\/\/doi.org\/10.1016\/j.simpat.2015.03.005","journal-title":"Simul Model Pract Theory"},{"key":"8698_CR10","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s11227-006-6255-3","volume":"37","author":"K Sinha","year":"2006","unstructured":"Sinha K, Srimani P (2006) Deterministic broadcast and gossiping algorithms for ad hoc networks. J Supercomput 37:115\u2013144. https:\/\/doi.org\/10.1007\/s11227-006-6255-3","journal-title":"J Supercomput"},{"key":"8698_CR11","doi-asserted-by":"publisher","unstructured":"Kumar S, Sharkawi SS, Jan KAN (2016) Optimization and analysis of mpi collective communication on fat-tree networks. In: 2016 IEEE International Parallel and Distributed Processing Symposium (IPDPS), 1031\u20131040. https:\/\/doi.org\/10.1109\/IPDPS.2016.85","DOI":"10.1109\/IPDPS.2016.85"},{"key":"8698_CR12","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-540-30218-6_28","volume-title":"Recent Advances in Parallel Virtual Machine and Message Passing Interface","author":"JL Tr\u00e4ff","year":"2004","unstructured":"Tr\u00e4ff JL (2004) A simple work-optimal broadcast algorithm for message-passing parallel systems. In: Kranzlm\u00fcller D, Kacsuk P, Dongarra J (eds) Recent Advances in Parallel Virtual Machine and Message Passing Interface. Springer, Berlin, Heidelberg, pp 173\u2013180"},{"key":"8698_CR13","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/11557654_8","volume-title":"High Performance Computing and Communications","author":"JL Tr\u00e4ff","year":"2005","unstructured":"Tr\u00e4ff JL, Ripke A (2005) Optimal broadcast for fully connected networks. In: Yang LT, Rana OF, Di Martino B, Dongarra J (eds) High Performance Computing and Communications. Springer, Berlin, Heidelberg, pp 45\u201356"},{"key":"8698_CR14","doi-asserted-by":"publisher","unstructured":"Pjesivac-Grbovic J, Angskun T, Bosilca G, Fagg GE, Gabriel E, Dongarra JJ (2005) Performance analysis of mpi collective operations. In: 19th IEEE International Parallel and Distributed Processing Symposium, 8. https:\/\/doi.org\/10.1109\/IPDPS.2005.335","DOI":"10.1109\/IPDPS.2005.335"},{"issue":"1","key":"8698_CR15","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/TKDE.2015.2468714","volume":"28","author":"C-J Wu","year":"2016","unstructured":"Wu C-J, Ku C-F, Ho J-M, Chen M-S (2016) A novel pipeline approach for efficient big data broadcasting. IEEE Trans Knowl Data Eng 28(1):17\u201328. https:\/\/doi.org\/10.1109\/TKDE.2015.2468714","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"8698_CR16","doi-asserted-by":"publisher","unstructured":"Beaumont O, Legrand A, Marchal L, Robert Y (2004) Pipelining broadcasts on heterogeneous platforms. In: 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings., 19. https:\/\/doi.org\/10.1109\/IPDPS.2004.1302926","DOI":"10.1109\/IPDPS.2004.1302926"},{"issue":"12","key":"8698_CR17","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1016\/j.parco.2009.09.001","volume":"35","author":"P Sanders","year":"2009","unstructured":"Sanders P, Speck J, Tr\u00e4ff JL (2009) Two-tree algorithms for full bandwidth broadcast, reduction and scan. Parallel Comput 35(12):581\u2013594. https:\/\/doi.org\/10.1016\/j.parco.2009.09.001. (Selected papers from the 14th European PVM\/MPI Users Group Meeting)","journal-title":"Parallel Comput"},{"key":"8698_CR18","doi-asserted-by":"publisher","unstructured":"De\u00a0Sensi D, Pasqualoni S, Piarulli L, Bonato T, Ba S, Turisini M, Domke J, Hoefler T (2025) Bine trees: Enhancing collective operations by optimizing communication locality. In: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis. SC \u201925, 1901\u20131916. Association for Computing Machinery, New York, NY, USA. https:\/\/doi.org\/10.1145\/3712285.3759835","DOI":"10.1145\/3712285.3759835"},{"key":"8698_CR19","doi-asserted-by":"publisher","first-page":"2245","DOI":"10.1109\/TPDS.2012.93","volume":"23","author":"P Zhang","year":"2012","unstructured":"Zhang P, Deng Y (2012) Design and analysis of pipelined broadcast algorithms for the all-port interlaced bypass torus networks. IEEE Trans Parallel Distrib Syst 23:2245\u20132253. https:\/\/doi.org\/10.1109\/TPDS.2012.93","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"8698_CR20","doi-asserted-by":"crossref","unstructured":"Dorier M, Mubarak M, Ross R, Li JK, Carothers CD, Ma K-L (2016) Evaluation of topology-aware broadcast algorithms for dragonfly networks. 2016 IEEE International Conference on Cluster Computing (CLUSTER). IEEE, 40\u201349","DOI":"10.1109\/CLUSTER.2016.26"},{"key":"8698_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TPDS.2015.2503746","volume":"27","author":"D Xiang","year":"2015","unstructured":"Xiang D, Liu X (2015) Deadlock-free broadcast routing in dragonfly networks without virtual channels. IEEE Trans Parallel Distrib Syst 27:1\u20131. https:\/\/doi.org\/10.1109\/TPDS.2015.2503746","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"2","key":"8698_CR22","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1109\/TCNS.2018.2839341","volume":"6","author":"D Silvestre","year":"2019","unstructured":"Silvestre D, Hespanha JP, Silvestre C (2019) Broadcast and gossip stochastic average consensus algorithms in directed topologies. IEEE Trans Control Netw Syst 6(2):474\u2013486. https:\/\/doi.org\/10.1109\/TCNS.2018.2839341","journal-title":"IEEE Trans Control Netw Syst"},{"key":"8698_CR23","doi-asserted-by":"publisher","unstructured":"Berenbrink P, Elsaesser R, Friedetzky T (2008) Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems. In: Proceedings of the Twenty-Seventh ACM Symposium on Principles of Distributed Computing. PODC \u201908, 155\u2013164. Association for Computing Machinery, New York, NY, USA. https:\/\/doi.org\/10.1145\/1400751.1400773","DOI":"10.1145\/1400751.1400773"},{"key":"8698_CR24","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1177\/1094342005051521","volume":"19","author":"R Thakur","year":"2005","unstructured":"Thakur R, Rabenseifner R, Gropp W (2005) Optimization of collective communication operations in mpich. Int J High Perform Comput Appl 19:49\u201366","journal-title":"Int J High Perform Comput Appl"},{"key":"8698_CR25","doi-asserted-by":"publisher","unstructured":"Thakur R, Gropp W (2003) Improving the performance of collective operations in mpich. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2840, 257\u2013267 https:\/\/doi.org\/10.1007\/978-3-540-39924-7_38","DOI":"10.1007\/978-3-540-39924-7_38"},{"issue":"5","key":"8698_CR26","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1109\/71.679219","volume":"9","author":"A Louri","year":"1998","unstructured":"Louri A, Weech B, Neocleous C (1998) A spanning multichannel linked hypercube: a gradually scalable optical interconnection network for massively parallel computing. IEEE Trans Parallel Distrib Syst 9(5):497\u2013512. https:\/\/doi.org\/10.1109\/71.679219","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"2.3","key":"8698_CR27","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1147\/rd.492.0265","volume":"49","author":"NR Adiga","year":"2005","unstructured":"Adiga NR, Blumrich MA, Chen D, Coteus P, Gara A, Giampapa ME, Heidelberger P, Singh S, Steinmacher-Burow BD, Takken T, Tsao M, Vranas P (2005) Blue gene\/l torus interconnection network. IBM J Res Dev 49(2.3):265\u2013276. https:\/\/doi.org\/10.1147\/rd.492.0265","journal-title":"IBM J Res Dev"},{"issue":"13","key":"8698_CR28","doi-asserted-by":"publisher","first-page":"1877","DOI":"10.1016\/S0167-8191(99)00069-1","volume":"25","author":"S Lakshmivarahan","year":"1999","unstructured":"Lakshmivarahan S, Dhall SK (1999) Ring, torus and hypercube architectures\/algorithms for parallel computing. Parallel Comput 25(13):1877\u20131906. https:\/\/doi.org\/10.1016\/S0167-8191(99)00069-1","journal-title":"Parallel Comput"},{"key":"8698_CR29","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.future.2013.06.019","volume":"30","author":"DJ Kerbyson","year":"2014","unstructured":"Kerbyson DJ, Barker KJ, Vishnu A, Hoisie A (2014) A performance comparison of current hpc systems: Blue gene\/q, cray xe6 and infiniband systems. Futur Gener Comput Syst 30:291\u2013304. https:\/\/doi.org\/10.1016\/j.future.2013.06.019","journal-title":"Futur Gener Comput Syst"},{"issue":"2","key":"8698_CR30","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1145\/1273440.1250679","volume":"35","author":"J Kim","year":"2007","unstructured":"Kim J, Dally WJ, Abts D (2007) Flattened butterfly: a cost-efficient topology for high-radix networks. SIGARCH Comput Archit News 35(2):126\u2013137. https:\/\/doi.org\/10.1145\/1273440.1250679","journal-title":"SIGARCH Comput Archit News"},{"key":"8698_CR31","doi-asserted-by":"publisher","unstructured":"Kim J, Dally WJ, Scott S, Abts D (2008) Technology-driven, highly-scalable dragonfly topology. In: Proceedings of the 35th Annual International Symposium on Computer Architecture. ISCA \u201908, 77\u201388. IEEE Computer Society, USA. https:\/\/doi.org\/10.1109\/ISCA.2008.19","DOI":"10.1109\/ISCA.2008.19"},{"key":"8698_CR32","doi-asserted-by":"crossref","unstructured":"Jain N, Bhatele A, Howell LH, B\u00f6hme D, Karlin I, Le\u00f3n EA, Mubarak M, Wolfe N, Gamblin T, Leininger ML (2017) Predicting the performance impact of different fat-tree configurations. SC17: International Conference for High Performance Computing, Networking, Storage and Analysis. 1\u201313","DOI":"10.1145\/3126908.3126967"},{"issue":"10","key":"8698_CR33","doi-asserted-by":"publisher","first-page":"892","DOI":"10.1109\/TC.1985.6312192","volume":"34","author":"CE Leiserson","year":"1985","unstructured":"Leiserson CE (1985) Fat-trees: universal networks for hardware-efficient supercomputing. IEEE Trans Comput 34(10):892\u2013901","journal-title":"IEEE Trans Comput"},{"key":"8698_CR34","doi-asserted-by":"publisher","unstructured":"Garc\u00eda M, Vallejo E, Beivide R, Odriozola M, Camarero C, Valero M, Rodr\u00edguez G, Labarta J, Minkenberg C (2012) On-the-fly adaptive routing in high-radix hierarchical networks. In: 2012 41st International Conference on Parallel Processing, 279\u2013288. https:\/\/doi.org\/10.1109\/ICPP.2012.46","DOI":"10.1109\/ICPP.2012.46"},{"key":"8698_CR35","doi-asserted-by":"publisher","unstructured":"Alm\u00e1si G, Heidelberger P, Archer CJ, Martorell X, Erway CC, Moreira JE, Steinmacher-Burow B, Zheng Y (2005) Optimization of mpi collective communication on bluegene\/l systems. In: Proceedings of the 19th Annual International Conference on Supercomputing. ICS \u201905, 253\u2013262. Association for Computing Machinery, New York, NY, USA. https:\/\/doi.org\/10.1145\/1088149.1088183","DOI":"10.1145\/1088149.1088183"},{"key":"8698_CR36","doi-asserted-by":"publisher","unstructured":"Subramoni H, Kandalla K, Vienne J, Sur S, Barth W, Tomko K, Mclay R, Schulz K, Panda DK (2011) Design and evaluation of network topology-\/speed- aware broadcast algorithms for infiniband clusters, 317\u2013325. https:\/\/doi.org\/10.1109\/CLUSTER.2011.43","DOI":"10.1109\/CLUSTER.2011.43"},{"key":"8698_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jpdc.2022.03.012","volume":"165","author":"E Nuriyev","year":"2022","unstructured":"Nuriyev E, Rico-Gallego J-A, Lastovetsky A (2022) Model-based selection of optimal mpi broadcast algorithms for multi-core clusters. J Parallel Distrib Comput 165:1\u201316","journal-title":"J Parallel Distrib Comput"},{"issue":"3","key":"8698_CR38","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1016\/S0167-8191(06)80021-9","volume":"20","author":"RW Hockney","year":"1994","unstructured":"Hockney RW (1994) The communication challenge for mpp: Intel paragon and meiko cs-2. Parallel Comput 20(3):389\u2013398. https:\/\/doi.org\/10.1016\/S0167-8191(06)80021-9","journal-title":"Parallel Comput"},{"issue":"7","key":"8698_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/173284.155333","volume":"28","author":"D Culler","year":"1993","unstructured":"Culler D, Karp R, Patterson D, Sahay A, Schauser KE, Santos E, Subramonian R, Eicken T (1993) Logp: towards a realistic model of parallel computation. SIGPLAN Not 28(7):1\u201312. https:\/\/doi.org\/10.1145\/173284.155333","journal-title":"SIGPLAN Not"},{"issue":"1","key":"8698_CR40","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1006\/jpdc.1997.1346","volume":"44","author":"A Alexandrov","year":"1997","unstructured":"Alexandrov A, Ionescu MF, Schauser KE, Scheiman C (1997) Loggp: Incorporating long messages into the logp model for parallel computation. J Parallel Distrib Comput 44(1):71\u201379. https:\/\/doi.org\/10.1006\/jpdc.1997.1346","journal-title":"J Parallel Distrib Comput"},{"key":"8698_CR41","doi-asserted-by":"crossref","unstructured":"Kielmann T, Bal HE, Verstoep, K (2000) Fast measurement of logp parameters for message passing platforms. In: Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing. IPDPS \u201900, 1176\u20131183. Springer, Berlin, Heidelberg","DOI":"10.1007\/3-540-45591-4_162"},{"key":"8698_CR42","doi-asserted-by":"publisher","unstructured":"Ino F, Fujimoto N, Hagihara K (2001) Loggps: a parallel computational model for synchronization analysis. SIGPLAN Not 36(7):133\u2013142. https:\/\/doi.org\/10.1145\/568014.379592","DOI":"10.1145\/568014.379592"},{"key":"8698_CR43","doi-asserted-by":"publisher","unstructured":"Coffman EG, Garey MR, Johnson DS, LaPaugh AS (1983) Scheduling file transfers in a distributed network. In: Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing. PODC \u201983, 254\u2013266. Association for Computing Machinery, New York, NY, USA. https:\/\/doi.org\/10.1145\/800221.806726","DOI":"10.1145\/800221.806726"},{"issue":"2","key":"8698_CR44","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1287\/opre.45.2.288","volume":"45","author":"DP Williamson","year":"1997","unstructured":"Williamson DP, Hall LA, Hoogeveen JA, Hurkens CAJ, Lenstra JK, Sevast\u2019janov SV, Shmoys DB (1997) Short shop schedules. Oper Res 45(2):288\u2013294. https:\/\/doi.org\/10.1287\/opre.45.2.288","journal-title":"Oper Res"},{"issue":"4","key":"8698_CR45","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/S0167-6377(99)00005-X","volume":"24","author":"P Schuurman","year":"1999","unstructured":"Schuurman P, Woeginger GJ (1999) Approximation algorithms for the multiprocessor open shop scheduling problem. Oper Res Lett 24(4):157\u2013163. https:\/\/doi.org\/10.1016\/S0167-6377(99)00005-X","journal-title":"Oper Res Lett"},{"key":"8698_CR46","doi-asserted-by":"publisher","unstructured":"Gabow HN, Kariv O (1978) Algorithms for edge coloring bipartite graphs. In: Proceedings of the Tenth Annual ACM Symposium on Theory of Computing. STOC \u201978, pp. 184\u2013192. Association for Computing Machinery, New York, NY, USA. https:\/\/doi.org\/10.1145\/800133.804346","DOI":"10.1145\/800133.804346"},{"key":"8698_CR47","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-025-01348-6","author":"G Chen","year":"2025","unstructured":"Chen G, Jing G, Zang W (2025) Proof of the goldberg-seymour conjecture on edge-colorings of multigraphs. J Comb Optim. https:\/\/doi.org\/10.1007\/s10878-025-01348-6","journal-title":"J Comb Optim"},{"key":"8698_CR48","doi-asserted-by":"publisher","unstructured":"Chen G, Hao Y, Yu X, Zang W (2024) A Short Proof of the Goldberg-Seymour Conjecture. https:\/\/doi.org\/10.48550\/arXiv.2407.09403","DOI":"10.48550\/arXiv.2407.09403"},{"issue":"1","key":"8698_CR49","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1006\/jagm.1998.0930","volume":"28","author":"MV Marathe","year":"1998","unstructured":"Marathe MV, Ravi R, Sundaram R, Ravi SS, Rosenkrantz DJ, Hunt HB (1998) Bicriteria network design problems. J Algorithms 28(1):142\u2013171. https:\/\/doi.org\/10.1006\/jagm.1998.0930","journal-title":"J Algorithms"},{"issue":"1","key":"8698_CR50","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00493-012-2552-z","volume":"32","author":"O Angel","year":"2012","unstructured":"Angel O, Flaxman AD, Wilson DB (2012) A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and steiner trees in random networks. Combinatorica 32(1):1\u201333. https:\/\/doi.org\/10.1007\/s00493-012-2552-z","journal-title":"Combinatorica"},{"issue":"2","key":"8698_CR51","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1287\/moor.20.2.257","volume":"20","author":"SA Plotkin","year":"1995","unstructured":"Plotkin SA, Shmoys DB, Tardos E (1995) Fast approximation algorithms for fractional packing and covering problems. Math Oper Res 20(2):257\u2013301. https:\/\/doi.org\/10.1287\/moor.20.2.257","journal-title":"Math Oper Res"},{"key":"8698_CR52","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511977152","volume-title":"Iterative Methods in Combinatorial Optimization","author":"L-C Lau","year":"2011","unstructured":"Lau L-C, Ravi R, Singh M (2011) Iterative Methods in Combinatorial Optimization. Cambridge University Press, Cambridge, UK"},{"issue":"6","key":"8698_CR53","doi-asserted-by":"publisher","first-page":"2467","DOI":"10.1109\/TIT.2006.874515","volume":"52","author":"Z Li","year":"2006","unstructured":"Li Z, Li B, Lau LC (2006) On achieving maximum multicast throughput in undirected networks. IEEE Trans Inf Theory 52(6):2467\u20132485. https:\/\/doi.org\/10.1109\/TIT.2006.874515","journal-title":"IEEE Trans Inf Theory"},{"issue":"2","key":"8698_CR54","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0095-8956(84)90023-6","volume":"36","author":"WH Cunningham","year":"1984","unstructured":"Cunningham WH (1984) Testing membership in matroid polyhedra. J Comb Theory Ser B 36(2):161\u2013188. https:\/\/doi.org\/10.1016\/0095-8956(84)90023-6","journal-title":"J Comb Theory Ser B"},{"key":"8698_CR55","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.parco.2025.103125","volume":"123","author":"H Casanova","year":"2025","unstructured":"Casanova H, Giersch A, Legrand A, Quinson M, Suter F (2025) Lowering entry barriers to developing custom simulators of distributed applications and platforms with SimGrid. Parallel Comput 123:103\u2013125. https:\/\/doi.org\/10.1016\/j.parco.2025.103125","journal-title":"Parallel Comput"},{"issue":"8","key":"8698_CR56","doi-asserted-by":"publisher","first-page":"2387","DOI":"10.1109\/TPDS.2017.2669305","volume":"28","author":"A Degomme","year":"2017","unstructured":"Degomme A, Legrand A, Markomanolis GS, Quinson M, Stillwell M, Suter F (2017) Simulating mpi applications: The smpi approach. IEEE Trans Parallel Distrib Syst 28(8):2387\u20132400. https:\/\/doi.org\/10.1109\/TPDS.2017.2669305","journal-title":"IEEE Trans Parallel Distrib Syst"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-026-08698-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-026-08698-w","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-026-08698-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T02:04:00Z","timestamp":1784513040000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-026-08698-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,20]]},"references-count":56,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2026,7]]}},"alternative-id":["8698"],"URL":"https:\/\/doi.org\/10.1007\/s11227-026-08698-w","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,20]]},"assertion":[{"value":"20 October 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 July 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 July 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The code for the different algorithms and simulations can be found on\n                      \n                      .","order":1,"name":"Ethics","label":"Code availability","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","label":"Conflict of interest","group":{"name":"EthicsHeading","label":"Declarations"}}],"article-number":"579"}}