{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T16:42:53Z","timestamp":1775839373315,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":22,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819610921","type":"print"},{"value":"9789819610938","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-1093-8_11","type":"book-chapter","created":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T21:18:47Z","timestamp":1739999927000},"page":"128-139","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Partition-and-Merge Algorithm for\u00a0Solving the\u00a0Steiner Tree Problem in\u00a0Large Graphs"],"prefix":"10.1007","author":[{"given":"Ming","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinyu","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin-Kao","family":"Hao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhang-Hua","family":"Fu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,20]]},"reference":[{"key":"11_CR1","unstructured":"Althaus, E., Blumenstock, M.: Algorithms for the maximum weight connected subgraph and prize-collecting Steiner tree problems (2014). http:\/\/dimacs11.cs.princeton.edu\/workshop.html"},{"issue":"2","key":"11_CR2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.86.026706","volume":"86","author":"I Biazzo","year":"2012","unstructured":"Biazzo, I., Braunstein, A., Zecchina, R.: Performance of a cavity-method-based algorithm for the prize-collecting Steiner tree problem on graphs. Phys. Rev. E 86(2), 026706 (2012)","journal-title":"Phys. Rev. E"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets m\u00f6bius: fast subset convolution. In: Proceedings of the 39th ACM Symposium on Theory of Computing, pp. 67\u201374 (2007)","DOI":"10.1145\/1250790.1250801"},{"key":"11_CR4","unstructured":"Bonnet, \u00c9., Sikora, F.: The pace 2018 parameterized algorithms and computational experiments challenge: the third iteration. In: IPEC 2018 (2018)"},{"issue":"1","key":"11_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2432622.2432628","volume":"60","author":"J Byrka","year":"2013","unstructured":"Byrka, J., Grandoni, F., Rothvo\u00df, T., Sanit\u00e0, L.: Steiner tree approximation via iterative randomized rounding. J. ACM 60(1), 1\u201333 (2013)","journal-title":"J. ACM"},{"issue":"1","key":"11_CR6","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s10479-018-2895-y","volume":"298","author":"F Carrabs","year":"2021","unstructured":"Carrabs, F., Cerulli, R., Pentangelo, R., Raiconi, A.: Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach. Ann. Oper. Res. 298(1), 65\u201378 (2021)","journal-title":"Ann. Oper. Res."},{"key":"11_CR7","unstructured":"Cheng, X., Du, D.Z.: Steiner Trees in Industry, vol.\u00a011. Springe (2013)"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Cheng, X., Li, Y., Du, D.Z., Ngo, H.Q.: Steiner trees in industry. In: Handbook of Combinatorial Optimization, pp. 193\u2013216. Springer (2004)","DOI":"10.1007\/0-387-23830-1_4"},{"issue":"3","key":"11_CR9","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.tcs.2008.06.046","volume":"406","author":"M Chleb\u00edk","year":"2008","unstructured":"Chleb\u00edk, M., Chleb\u00edkov\u00e1, J.: The Steiner tree problem on graphs: Inapproximability results. Theoret. Comput. Sci. 406(3), 207\u2013214 (2008)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"11_CR10","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s12532-016-0111-0","volume":"9","author":"M Fischetti","year":"2017","unstructured":"Fischetti, M., et al.: Thinning out Steiner trees: a node-based model for uniform edge costs. Math. Program. Comput. 9(2), 203\u2013229 (2017)","journal-title":"Math. Program. Comput."},{"issue":"2","key":"11_CR11","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s12532-016-0116-8","volume":"9","author":"ZH Fu","year":"2017","unstructured":"Fu, Z.H., Hao, J.K.: Swap-vertex based neighborhood for Steiner tree problems. Math. Program. Comput. 9(2), 297\u2013320 (2017)","journal-title":"Math. Program. Comput."},{"issue":"2","key":"11_CR12","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s12532-016-0114-x","volume":"9","author":"G Gamrath","year":"2017","unstructured":"Gamrath, G., Koch, T., Maher, S.J., Rehfeldt, D., Shinano, Y.: SCIP-jack-a solver for STP and variants with parallelization extensions. Math. Program. Comput. 9(2), 231\u2013296 (2017)","journal-title":"Math. Program. Comput."},{"key":"11_CR13","first-page":"33","volume":"31","author":"S Held","year":"2011","unstructured":"Held, S., Korte, B., Rautenbach, D., Vygen, J.: Combinatorial optimization in VLSI design. Combin. Optim.-Meth. Appl. 31, 33\u201396 (2011)","journal-title":"Combin. Optim.-Meth. Appl."},{"issue":"6","key":"11_CR14","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1109\/JSAC-OCN.2007.021305","volume":"25","author":"CY Hsieh","year":"2007","unstructured":"Hsieh, C.Y., Liao, W.: All-optical multicast routing in sparse splitting WDM networks. IEEE J. Sel. Areas Commun. 25(6), 51\u201362 (2007)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"11_CR15","unstructured":"Johnson, D.S., Koch, T., Werneck, R.F., Zachariasen, M.: 11th Dimacs implementation challenge in collaboration with Icerm: steiner tree problems (2014)"},{"key":"11_CR16","unstructured":"Karger, D.R.: Global min-cuts in RNC, and other ramifications of a simple min-cut algorithm. In: SODA, vol.\u00a093, pp. 21\u201330. Citeseer (1993)"},{"issue":"7","key":"11_CR17","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1016\/j.knosys.2006.04.012","volume":"19","author":"Z Kun","year":"2006","unstructured":"Kun, Z., Yong, Q., Hong, Z.: Dynamic multicast routing algorithm for delay and delay variation-bounded Steiner tree problem. Knowl.-Based Syst. 19(7), 554\u2013564 (2006)","journal-title":"Knowl.-Based Syst."},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Lappas, T., Liu, K., Terzi, E.: Finding a team of experts in social networks. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 467\u2013476 (2009)","DOI":"10.1145\/1557019.1557074"},{"key":"11_CR19","unstructured":"Luipersbeck, M.: A new partition-based heuristic for the Steiner tree problem in large graphs. Ph.D. thesis, Technische Universit\u00e4t Wien (2013)"},{"issue":"1","key":"11_CR20","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s12532-017-0123-4","volume":"10","author":"T Pajor","year":"2018","unstructured":"Pajor, T., Uchoa, E., Werneck, R.F.: A robust and scalable algorithm for the Steiner problem in graphs. Math. Program. Comput. 10(1), 69\u2013118 (2018)","journal-title":"Math. Program. Comput."},{"issue":"3","key":"11_CR21","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1287\/ijoc.14.3.228.116","volume":"14","author":"CC Ribeiro","year":"2002","unstructured":"Ribeiro, C.C., Uchoa, E., Werneck, R.F.: A hybrid grasp with perturbations for the Steiner problem in graphs. INFORMS J. Comput. 14(3), 228\u2013246 (2002)","journal-title":"INFORMS J. Comput."},{"key":"11_CR22","first-page":"1","volume":"17","author":"E Uchoa","year":"2012","unstructured":"Uchoa, E., Werneck, R.F.: Fast local search for the Steiner problem in graphs. J. Exp. Algorithmics (JEA) 17, 1\u20132 (2012)","journal-title":"J. Exp. Algorithmics (JEA)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-1093-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T21:18:53Z","timestamp":1739999933000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-1093-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819610921","9789819610938"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-1093-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"20 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/anl.sjtu.edu.cn\/cocoon2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}