{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T10:10:09Z","timestamp":1746439809745,"version":"3.40.4"},"publisher-location":"Singapore","reference-count":21,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819644445","type":"print"},{"value":"9789819644452","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-4445-2_13","type":"book-chapter","created":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T09:33:54Z","timestamp":1746437634000},"page":"151-162","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0Constrained Steiner Strong Connectivity Augmentation Problem"],"prefix":"10.1007","author":[{"given":"Junran","family":"Lichen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuwen","family":"Ge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Runtao","family":"Xie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ping","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,6]]},"reference":[{"issue":"4","key":"13_CR1","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(89)90039-2","volume":"32","author":"MW Bern","year":"1989","unstructured":"Bern, M.W., Plassmann, P.E.: The Steiner problem with edge lengths 1 and 2. Inf. Process. Lett. 32(4), 171\u2013176 (1989)","journal-title":"Inf. Process. Lett."},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Busacker, R.G., Gowen, P.J.: A procedure for determining a family of minimum cost network flow patterns. ORO Technical Paper 15, Operational Research Office, Johns Hopkins University, Baltimore (1961)","DOI":"10.21236\/AD0249662"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2432622.2432628","volume":"60","author":"J Byrka","year":"2013","unstructured":"Byrka, J., Grandoni, F., Rothvoss, T., Sanit\u00e0, L.: Steiner tree approximation via iterative randomized rounding. J. ACM 60, 1\u201333 (2013)","journal-title":"J. ACM"},{"issue":"1","key":"13_CR4","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1006\/jagm.1999.1042","volume":"33","author":"M Charikar","year":"1999","unstructured":"Charikar, M., et al.: Approximation algorithms for directed Steiner problems. J. Algorithms 33(1), 73\u201391 (1999)","journal-title":"J. Algorithms"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.tcs.2013.04.004","volume":"489","author":"N Cohen","year":"2013","unstructured":"Cohen, N., Nutov, Z.: A $$(1+\\ln 2)$$-approximation algorithm for minimum-cost 2-edge-connectivity augmentation of trees with constant radius. Theoret. Comput. Sci. 489, 67\u201374 (2013)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1137\/0205044","volume":"5","author":"KP Eswaran","year":"1976","unstructured":"Eswaran, K.P., Tarjan, R.E.: Augmentation problems. SIAM J. Comput. 5, 653\u2013665 (1976)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"13_CR7","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1137\/0210019","volume":"10","author":"G Frederickson","year":"1981","unstructured":"Frederickson, G., J\u00e1J\u00e1, J.: Approximation algorithms for several graph augmentation problems. SIAM J. Comput. 10(2), 270\u2013283 (1981)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"13_CR8","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1137\/19M1258530","volume":"49","author":"L Georgiadis","year":"2020","unstructured":"Georgiadis, L., Italino, G.F., Parotsidia, N.: Strong connectivity in directed graphs under failures, with applications. SIAM J. Comput. 49(5), 865\u2013926 (2020)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"13_CR9","first-page":"298","volume":"52","author":"F Grandoni","year":"2022","unstructured":"Grandoni, F., Laekhanukit, B., Li, S.: $$O(\\log ^2{k}\/\\log \\log {k})$$-approximation algorithm for directed steiner tree: a tight quasi-polynomial time algorithm. SIAM J. Comput. 52(2), 298\u2013322 (2022)","journal-title":"SIAM J. Comput."},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Hartmanis, J., Computers and intractability: a guide to the theory of NP-completeness (Michael R. Garey and David S. Johnson). SIAM Rev. 24, 90\u201391 (1982)","DOI":"10.1137\/1024022"},{"issue":"5","key":"13_CR11","doi-asserted-by":"publisher","first-page":"785","DOI":"10.26599\/TST.2021.9010053","volume":"27","author":"L Han","year":"2022","unstructured":"Han, L., Wang, C.J., Xu, D.C., Zhang, D.M.: Algorithms for the prize-collecting $$k$$-Steiner tree problem. Tsinghua Sci. Technol. 27(5), 785\u2013792 (2022)","journal-title":"Tsinghua Sci. Technol."},{"issue":"3","key":"13_CR12","doi-asserted-by":"publisher","first-page":"2265","DOI":"10.1137\/20M1336229","volume":"35","author":"F Hommelsheim","year":"2021","unstructured":"Hommelsheim, F., Muehlenthaler, M., Schaudt, D.: How to secure matchings against edge failures. SIAM J. Discret. Math. 35(3), 2265\u20132292 (2021)","journal-title":"SIAM J. Discret. Math."},{"issue":"2","key":"13_CR13","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1006\/jagm.1993.1010","volume":"14","author":"S Khuller","year":"1993","unstructured":"Khuller, S., Thurimella, R.: Approximation algorithms for graph augmentation. J. Algorithms 14(2), 214\u2013225 (1993)","journal-title":"J. Algorithms"},{"key":"13_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-56039-6","volume-title":"Combinatorial Optimization: Theory and Algorithms","author":"B Korte","year":"2018","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms, 6th edn. Springer-Verlag, Berlin (2018)","edition":"6"},{"key":"13_CR15","unstructured":"Li, J., Xie, R., Lichen, J.: Approximation algorithms to solve the constrained directed Steiner tree augmentation problem, submitted (2024)"},{"key":"13_CR16","unstructured":"Lichen, J., Ge, S., Xie, R.: Approximation algorithms to solve the constrained Steiner strong connectivity augmentation problem (Full version), prepared (2024)"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/S0166-218X(02)00218-4","volume":"126","author":"H Nagamochi","year":"2003","unstructured":"Nagamochi, H.: An approximation for finding a smallest 2-edge connected subgraph containing a specified spanning tree. Discret. Appl. Math. 126, 83\u2013113 (2003)","journal-title":"Discret. Appl. Math."},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1137\/S0895480101393155","volume":"19","author":"G Robins","year":"2005","unstructured":"Robins, G., Zelikovsky, A.: Tighter bounds for graph Steiner tree approximation. SIAM J. Discret. Math. 19, 122\u2013134 (2005)","journal-title":"SIAM J. Discret. Math."},{"issue":"1","key":"13_CR19","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1137\/0206003","volume":"6","author":"A Rosenthal","year":"1977","unstructured":"Rosenthal, A., Goldner, A.: Smallest augmentations to biconnect a graph. SIAM J. Comput. 6(1), 55\u201366 (1977)","journal-title":"SIAM J. Comput."},{"key":"13_CR20","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency, Volume A-C, Springer-Verlag Berlin Heidelberg (2004)"},{"key":"13_CR21","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0020-0190(74)90024-6","volume":"3","author":"RE Tarjan","year":"1974","unstructured":"Tarjan, R.E.: A good algorithm for edge-disjoint branching. Inf. Process. Lett. 3, 51\u201353 (1974)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-4445-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T09:33:55Z","timestamp":1746437635000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-4445-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819644445","9789819644452"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-4445-2_13","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":"6 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors declare that they have no conflict of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","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":"6 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.cocoa2024.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}