{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T04:34:36Z","timestamp":1768106076733,"version":"3.49.0"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,11,27]],"date-time":"2021-11-27T00:00:00Z","timestamp":1637971200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,11,27]],"date-time":"2021-11-27T00:00:00Z","timestamp":1637971200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Parallel Prog"],"published-print":{"date-parts":[[2022,2]]},"DOI":"10.1007\/s10766-021-00723-0","type":"journal-article","created":{"date-parts":[[2021,11,27]],"date-time":"2021-11-27T07:05:02Z","timestamp":1637996702000},"page":"152-185","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Accelerating Computation of Steiner Trees on GPUs"],"prefix":"10.1007","volume":"50","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4702-4678","authenticated-orcid":false,"given":"Rajesh Pandian","family":"Muniasamy","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7490-625X","authenticated-orcid":false,"given":"Rupesh","family":"Nasre","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8771-3921","authenticated-orcid":false,"given":"N. S.","family":"Narayanaswamy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,11,27]]},"reference":[{"key":"723_CR1","doi-asserted-by":"publisher","unstructured":"Hwang, F. K., Richards, D. S., Winter, P.: Monograph. In: The Steiner Tree Problem, Annals of Discrete Mathematics, vol.\u00a053. Elsevier (1992). https:\/\/doi.org\/10.1016\/S0167-5060(08)70188-2. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0167506008701894","DOI":"10.1016\/S0167-5060(08)70188-2"},{"issue":"3","key":"723_CR2","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1002\/net.3230010302","volume":"1","author":"SE Dreyfus","year":"1971","unstructured":"Dreyfus, S.E., Wagner, R.A.: The Steiner problem in graphs. Networks 1(3), 195\u2013207 (1971)","journal-title":"Networks"},{"issue":"3","key":"723_CR3","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/s00224-007-1324-4","volume":"41","author":"B Fuchs","year":"2007","unstructured":"Fuchs, B., Kern, W., Molle, D., Richter, S., Rossmanith, P., Wang, X.: Dynamic programming for minimum Steiner trees. Theor. Comput. Syst. 41(3), 493\u2013500 (2007). https:\/\/doi.org\/10.1007\/s00224-007-1324-4","journal-title":"Theor. Comput. Syst."},{"key":"723_CR4","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)"},{"key":"723_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms, 1st edn. Springer Publishing Company, Incorporated, Cham (2015)","edition":"1"},{"key":"723_CR6","unstructured":"Johnson, D.S., Koch, T., Werneck, R.F., Zachariasen, M.: 11th DIMACS Implementation Challenge in Collaboration with ICERM: Steiner Tree Problems. (2014). [Online; accessed 27-Mar-2019]"},{"key":"723_CR7","unstructured":"Bonnet, \u00c9., Sikora, F.: The 3rd Parameterized Algorithms and Computational Experiments Challenge. https:\/\/pacechallenge.org\/2018\/ (2018). [Online; accessed 27-Mar-2019]"},{"key":"723_CR8","doi-asserted-by":"publisher","unstructured":"Bonnet, \u00c9., Sikora, F.: The PACE 2018 Parameterized Algorithms and Computational Experiments Challenge: The Third Iteration. In: C.\u00a0Paul, M.\u00a0Pilipczuk (eds.) 13th International Symposium on Parameterized and Exact Computation (IPEC 2018), Leibniz International Proceedings in Informatics (LIPIcs), vol. 115, pp. 26:1\u201326:15. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2019). https:\/\/doi.org\/10.4230\/LIPIcs.IPEC.2018.26. http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2019\/10227","DOI":"10.4230\/LIPIcs.IPEC.2018.26"},{"issue":"3","key":"723_CR9","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0020-0190(88)90066-X","volume":"27","author":"K Mehlhorn","year":"1988","unstructured":"Mehlhorn, K.: A faster approximation algorithm for the steiner problem in graphs. Inf. Process. Lett. 27(3), 125\u2013128 (1988). https:\/\/doi.org\/10.1016\/0020-0190(88)90066-X","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"723_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1541885.1541892","volume":"5","author":"G Borradaile","year":"2009","unstructured":"Borradaile, G., Klein, P.N., Mathieu, C.: An On (n log n) approximation scheme for steiner tree in planar graphs. ACM Trans. Algorithms 5(3), 1\u201331 (2009). https:\/\/doi.org\/10.1145\/1541885.1541892","journal-title":"ACM Trans. Algorithms"},{"issue":"5","key":"723_CR11","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/BF01187035","volume":"9","author":"A Zelikovsky","year":"1993","unstructured":"Zelikovsky, A.: An 11\/6-approximation algorithm for the network steiner problem. Algorithmica 9(5), 463\u2013470 (1993). https:\/\/doi.org\/10.1007\/BF01187035","journal-title":"Algorithmica"},{"key":"723_CR12","unstructured":"Robins, G., Zelikovsky, A.: Improved steiner tree approximation in graphs. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, USA., pp. 770\u2013779 (2000). http:\/\/dl.acm.org\/citation.cfm?id=338219.338638"},{"issue":"3","key":"723_CR13","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1137\/S0097539792236237","volume":"24","author":"A Agrawal","year":"1995","unstructured":"Agrawal, A., Klein, P.N., Ravi, R.: When trees collide: An approximation algorithm for the generalized steiner problem on networks. SIAM J. Comput. 24(3), 440\u2013456 (1995). https:\/\/doi.org\/10.1137\/S0097539792236237","journal-title":"SIAM J. Comput."},{"issue":"2","key":"723_CR14","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BF00288961","volume":"15","author":"L Kou","year":"1981","unstructured":"Kou, L., Markowsky, G., Berman, L.: A fast algorithm for Steiner trees. Acta Informatica 15(2), 141\u2013145 (1981). https:\/\/doi.org\/10.1007\/BF00288961","journal-title":"Acta Informatica"},{"key":"723_CR15","unstructured":"Koch, T., Martin, A., Vo\u00df, S.: Steinlib Testdata Library (2015). http:\/\/steinlib.zib.de\/steinlib.php. Online; Accessed 27-March-2019"},{"issue":"1","key":"723_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3299903","volume":"24","author":"S Beyer","year":"2019","unstructured":"Beyer, S., Chimani, M.: Strong steiner tree approximations in practice. J. Exp. Algorithmics (JEA) 24(1), 1\u201333 (2019). https:\/\/doi.org\/10.1145\/3299903","journal-title":"J. Exp. Algorithmics (JEA)"},{"key":"723_CR17","unstructured":"Romero Ruiz, E., Antonio Cuevas, E., EnriqueVillalobos L\u00f3pez, I., Segura Gonz\u00e1lez, C.: (CIMAT Team from the Center for Researchin Mathematics, Guanajuato). https:\/\/github.com\/HeathcliffAC\/SteinerTreeProblem (2018). [Online; accessed 21-April-2020]"},{"key":"723_CR18","first-page":"543","volume-title":"Handbook on Graph Drawing and Visualization","author":"M Chimani","year":"2013","unstructured":"Chimani, M., Gutwenger, C., J\u00fcnger, M., Klau, G.W., Klein, K., Mutzel, P.: The open graph drawing framework (OGDF). In: Tamassia, R. (ed.) Handbook on Graph Drawing and Visualization, pp. 543\u2013569. Chapman and Hall\/CRC, London (2013)"},{"key":"723_CR19","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms 3rd Edition. MIT Press , Cambridge (2009). http:\/\/mitpress.mit.edu\/books\/introduction-algorithms"},{"key":"723_CR20","doi-asserted-by":"publisher","unstructured":"Lenharth, A., Nguyen, D., Pingali, K.: Priority queues are not good concurrent priority schedulers. In: J.L. Tr\u00e4ff, S.\u00a0Hunold, F.\u00a0Versaci (eds.) Euro-Par 2015: Parallel Processing - 21st International Conference on Parallel and Distributed Computing, Vienna, Austria, Proceedings, Lecture Notes in Computer Science, vol. 9233, pp. 209\u2013221. Springer (2015). https:\/\/doi.org\/10.1007\/978-3-662-48096-0_17","DOI":"10.1007\/978-3-662-48096-0_17"},{"key":"723_CR21","doi-asserted-by":"publisher","unstructured":"Harish, P., Narayanan, P.J.: Accelerating large graph algorithms on the GPU using CUDA. In: High Performance Computing - HiPC 2007, 14th International Conference, Goa, India, Proceedings, pp. 197\u2013208 (2007). https:\/\/doi.org\/10.1007\/978-3-540-77220-0_21","DOI":"10.1007\/978-3-540-77220-0_21"},{"key":"723_CR22","doi-asserted-by":"publisher","unstructured":"Mart\u00edn, P.J., Torres, R., Gavilanes, A.: CUDA solutions for the SSSP problem. In: Computational Science - ICCS 2009, 9th International Conference, Baton Rouge, LA, USA, May 25-27, 2009, Proceedings, Part I, pp. 904\u2013913 (2009). https:\/\/doi.org\/10.1007\/978-3-642-01970-8_91","DOI":"10.1007\/978-3-642-01970-8_91"},{"key":"723_CR23","doi-asserted-by":"publisher","unstructured":"Nasre, R., Burtscher, M., Pingali, K.: Data-driven versus topology-driven irregular computations on gpus. In: 27th IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2013, Cambridge, MA, USA, pp. 463\u2013474 (2013). https:\/\/doi.org\/10.1109\/IPDPS.2013.28","DOI":"10.1109\/IPDPS.2013.28"},{"key":"723_CR24","unstructured":"Acar, U.A., Blelloch, G.E.: Algorithms: Parallel and Sequential. Online-Draft (2019). http:\/\/www.algorithms-book.com\/"},{"issue":"3","key":"723_CR25","doi-asserted-by":"publisher","first-page":"297","DOI":"10.14778\/3157794.3157799","volume":"11","author":"Z Jia","year":"2017","unstructured":"Jia, Z., Kwon, Y., Shipman, G.M., McCormick, P.S., Erez, M., Aiken, A.: A distributed multi-gpu system for fast graph processing. Proc. VLDB Endow. 11(3), 297\u2013310 (2017)https:\/\/doi.org\/10.14778\/3157794.3157799","journal-title":"Proc. VLDB Endow."},{"key":"723_CR26","doi-asserted-by":"publisher","unstructured":"Salvador, G., Darvin, W.H., Huzaifa, M., Alsop, J., Sinclair, M.D., Adve, S.V.: Specializing Coherence, Consistency, and Push\/pull for GPU Graph Analytics. In: IEEE International Symposium on Performance Analysis of Systems and Software, ISPASS 2020, Boston, MA, USA, August 23-25, 2020, pp. 123\u2013125. IEEE (2020). https:\/\/doi.org\/10.1109\/ISPASS48437.2020.00027http:\/\/dimacs11.zib.de\/home.html","DOI":"10.1109\/ISPASS48437.2020.00027"},{"key":"723_CR27","doi-asserted-by":"publisher","unstructured":"Merrill, D., Garland, M., Grimshaw, A.S.: Scalable GPU graph traversal. In: Proceedings of the 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP 2012, New Orleans, LA, USA, pp. 117\u2013128 (2012). https:\/\/doi.org\/10.1145\/2145816.2145832","DOI":"10.1145\/2145816.2145832"},{"issue":"1","key":"723_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3108140","volume":"4","author":"Y Wang","year":"2017","unstructured":"Wang, Y., Pan, Y., Davidson, A.A., Wu, Y., Yang, C., Wang, L., Osama, M., Yuan, C., Liu, W., Riffel, A.T., Owens, J.D.: Gunrock: GPU graph analytics. ACM Trans. Parallel Comput. 4(1), 1\u201349 (2017). https:\/\/doi.org\/10.1145\/3108140","journal-title":"ACM Trans. Parallel Comput."},{"key":"723_CR29","unstructured":"Gunrock Developers: (CIMAT Team from the Center for Researchin Mathematics, Guanajuato). https:\/\/github.com\/gunrock\/gunrock\/releases\/tag\/v1.0 (2019). [Online; accessed 21-April-2020]"},{"key":"723_CR30","unstructured":"Leskovec, J., Krevl, A.: SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data (2014)"},{"key":"723_CR31","doi-asserted-by":"publisher","unstructured":"Vineet, V., Harish, P., Patidar, S., Narayanan, P.J.: Fast Minimum Spanning Tree for Large Graphs on the GPU. In: Proceedings of the ACM SIGGRAPH\/EUROGRAPHICS Conference on High Performance Graphics 2009, New Orleans, Louisiana, USA, pp. 167\u2013171 (2009). https:\/\/doi.org\/10.2312\/EGGH\/HPG09\/167-172","DOI":"10.2312\/EGGH\/HPG09\/167-172"},{"issue":"4","key":"723_CR32","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1137\/0210049","volume":"10","author":"E Dekel","year":"1981","unstructured":"Dekel, E., Nassimi, D., Sahni, S.: Parallel matrix and graph algorithms. SIAM J. Comput. 10(4), 657\u2013675 (1981). https:\/\/doi.org\/10.1137\/0210049","journal-title":"SIAM J. Comput."},{"issue":"4","key":"723_CR33","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/0020-0190(90)90163-R","volume":"34","author":"G Ramalingam","year":"1990","unstructured":"Ramalingam, G., Rangan, C.P.: New sequential and parallel algorithms for interval graph recognition. Inf. Process. Lett. 34(4), 215\u2013219 (1990). https:\/\/doi.org\/10.1016\/0020-0190(90)90163-R","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"723_CR34","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1145\/2514.2515","volume":"16","author":"MJ Quinn","year":"1984","unstructured":"Quinn, M.J., Deo, N.: Parallel graph algorithms. ACM Comput. Surv. (CSUR) 16(3), 319\u2013348 (1984). https:\/\/doi.org\/10.1145\/2514.2515","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"723_CR35","unstructured":"Pawan\u00a0Harish, V.V., Narayanan, P.J.: Large Graph Algorithms for Massively Multithreaded Architectures. In: (Technical Report), IIIT-H, IIIT\/TR\/2009\/74 (2009). https:\/\/researchweb.iiit.ac.in\/~harishpk\/PDF\/TR-2009_74.pdf"},{"key":"723_CR36","doi-asserted-by":"publisher","unstructured":"Barnat, J., Bauch, P., Brim, L., Jr., Cesika, M.: Computing strongly connected components in parallel on CUDA. In: 25th IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2011, Anchorage, Alaska, USA, 16-20 May, 2011 - Conference Proceedings, pp. 544\u2013555 (2011). https:\/\/doi.org\/10.1109\/IPDPS.2011.59","DOI":"10.1109\/IPDPS.2011.59"},{"key":"723_CR37","doi-asserted-by":"publisher","unstructured":"Dhulipala, L., Blelloch, G.E., Shun, J.: Theoretically efficient parallel graph algorithms can be fast and scalable. In: Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, SPAA 2018, Vienna, Austria, pp. 393\u2013404 (2018). https:\/\/doi.org\/10.1145\/3210377.3210414","DOI":"10.1145\/3210377.3210414"},{"key":"723_CR38","doi-asserted-by":"publisher","unstructured":"van\u00a0der Zanden, T.C., Bodlaender, H.L.: Computing Treewidth on the GPU. In: 12th International Symposium on Parameterized and Exact Computation, IPEC 2017, Vienna, Austria, pp. 1\u201313 (2017). https:\/\/doi.org\/10.4230\/LIPIcs.IPEC.2017.29","DOI":"10.4230\/LIPIcs.IPEC.2017.29"},{"key":"723_CR39","unstructured":"Fischetti,M., Leitner, M., Ljubic, I., Luipersbeck, M., Monaci, M., Resch, M., Salvagnin, D., Sinnl, M. : Approximate the steiner tree using the KMB heuristic. https:\/\/homepage.univie.ac.at\/ivana.ljubic\/research\/staynerd\/StayNerd.html (2015). [Online; accessed 21-April-2019]"},{"issue":"2","key":"723_CR40","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s12532-016-0111-0","volume":"9","author":"M Fischetti","year":"2017","unstructured":"Fischetti, M., Leitner, M., Ljubic, I., Luipersbeck, M., Monaci, M., Resch, M., Salvagnin, D., Sinnl, M.: Thinning out steiner trees: a node-based model for uniform edge costs. Math. Program. Comput. 9(2), 203\u2013229 (2017). https:\/\/doi.org\/10.1007\/s12532-016-0111-0","journal-title":"Math. Program. Comput."},{"key":"723_CR41","doi-asserted-by":"publisher","unstructured":"Koch, T., Martin, A., Vo\u00df, S.: SteinLib: An Updated Library on Steiner Tree Problems in Graphs, pp. 285\u2013325. Springer US (2001). https:\/\/doi.org\/10.1007\/978-1-4613-0255-1_9","DOI":"10.1007\/978-1-4613-0255-1_9"},{"key":"723_CR42","doi-asserted-by":"publisher","unstructured":"Suzuki, H., Yamanaka, C., Nishizeki, T.: Parallel Algorithms for Finding Steiner Forests in Planar Graphs. In: Algorithms, International Symposium SIGAL \u201990, Tokyo, Japan, Proceedings, pp. 458\u2013467 (1990). https:\/\/doi.org\/10.1007\/3-540-52921-7_95","DOI":"10.1007\/3-540-52921-7_95"},{"issue":"1\u20132","key":"723_CR43","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0166-218X(94)90093-0","volume":"51","author":"E Dahlhaus","year":"1994","unstructured":"Dahlhaus, E.: A parallel algorithm for computing steiner trees in strongly chordal graphs. Discret. Appl. Math. 51(1\u20132), 47\u201361 (1994). https:\/\/doi.org\/10.1016\/0166-218X(94)90093-0","journal-title":"Discret. Appl. Math."},{"key":"723_CR44","unstructured":"Hauptmann, M., Karpinski, M.: A Compendium on Steiner Tree Problems. http:\/\/theory.cs.uni-bonn.de\/info5\/steinerkompendium\/ (2015). http:\/\/theory.cs.uni-bonn.de\/info5\/steinerkompendium\/netcompendium.pdf. [Online; accessed 27-Dec-2020]"},{"key":"723_CR45","doi-asserted-by":"publisher","unstructured":"Park, J., Ro, W.W., Lee, H., Park, N.: Parallel Algorithms for Steiner Tree Problem. In: Third International Conference on Convergence and Hybrid Information Technology, vol.\u00a01, pp. 453\u2013455 (2008). https:\/\/doi.org\/10.1109\/ICCIT.2008.167","DOI":"10.1109\/ICCIT.2008.167"},{"key":"723_CR46","unstructured":"Makki, K., Been, K., Pissinou, N.: A Parallel Algorithm for the Steiner Tree Problem. In: Computing and Information - ICCI\u201993, Fifth International Conference on Computing and Information, Sudbury, Ontario, Canada, May 27-29, 1993, Proceedings, pp. 380\u2013384 (1993)"},{"issue":"2","key":"723_CR47","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s10766-013-0243-z","volume":"42","author":"M Bezensek","year":"2014","unstructured":"Bezensek, M., Robic, B.: A survey of parallel and distributed algorithms for the steiner tree problem. Int. J. Parallel Program. 42(2), 287\u2013319 (2014). https:\/\/doi.org\/10.1007\/s10766-013-0243-z","journal-title":"Int. J. Parallel Program."},{"issue":"1","key":"723_CR48","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.vlsi.2013.08.001","volume":"47","author":"W Chow","year":"2014","unstructured":"Chow, W., Li, L., Young, E.F.Y., Sham, C.: Obstacle-avoiding rectilinear steiner tree construction in sequential and parallel approach. Integration 47(1), 105\u2013114 (2014). https:\/\/doi.org\/10.1016\/j.vlsi.2013.08.001","journal-title":"Integration"},{"key":"723_CR49","doi-asserted-by":"publisher","unstructured":"Mathieu, C., Klusch, M.: Accelerated steiner tree problem solving on GPU with CUDA. In: Algorithms and Architectures for Parallel Processing - 15th International Conference, ICA3PP 2015, Zhangjiajie, China, Proceedings, Part II, pp. 444\u2013457 (2015). https:\/\/doi.org\/10.1007\/978-3-319-27122-4_31","DOI":"10.1007\/978-3-319-27122-4_31"}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-021-00723-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10766-021-00723-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-021-00723-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,29]],"date-time":"2022-01-29T14:08:40Z","timestamp":1643465320000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10766-021-00723-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,27]]},"references-count":49,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,2]]}},"alternative-id":["723"],"URL":"https:\/\/doi.org\/10.1007\/s10766-021-00723-0","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"value":"0885-7458","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,11,27]]},"assertion":[{"value":"29 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 November 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 November 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}