{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:36:20Z","timestamp":1742985380816,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030489656"},{"type":"electronic","value":"9783030489663"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-48966-3_26","type":"book-chapter","created":{"date-parts":[[2020,5,28]],"date-time":"2020-05-28T13:04:23Z","timestamp":1590671063000},"page":"343-354","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Bounded Degree Group Steiner Tree Problems"],"prefix":"10.1007","author":[{"given":"Guy","family":"Kortsarz","sequence":"first","affiliation":[]},{"given":"Zeev","family":"Nutov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,29]]},"reference":[{"key":"26_CR1","unstructured":"Bartal, Y.: Probabilistic approximations of metric spaces and its algorithmic applications. In: FOCS, pp. 184\u2013193 (1996)"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Chalermsook, P., Das, S., Laekhanukit, B., Vaz, D.: Beyond metric embedding: approximating group Steiner trees on bounded treewidth graphs. In: SODA, pp. 737\u2013751 (2017)","DOI":"10.1137\/1.9781611974782.47"},{"issue":"1","key":"26_CR3","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"},{"issue":"1","key":"26_CR4","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.dam.2005.07.010","volume":"154","author":"C Chekuri","year":"2006","unstructured":"Chekuri, C., Even, G., Kortsarz, G.: A greedy approximation algorithm for the group Steiner problem. Discrete Appl. Math. 154(1), 15\u201334 (2006)","journal-title":"Discrete Appl. Math."},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Dehghani, S., Ehsani, S., Hajiaghayi, M.T., Liaghat, L.: Online degree-bounded Steiner network design. In: SODA, pp. 164\u2013175 (2016)","DOI":"10.1137\/1.9781611974331.ch13"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Dehghani, S., Ehsani, S., Hajiaghayi, M.T., Liaghat, V., R\u00e4cke, H., Seddighin, S.: Online weighted degree-bounded Steiner networks via novel online mixed packing\/covering. In: ICALP, pp. 42:1\u201342:14 (2016)","DOI":"10.1137\/1.9781611974331.ch13"},{"key":"26_CR7","unstructured":"Dehghani, S., Ehsani, S., Hajiaghayi, M.T., Liaghat, V., Seddighin, S.: Greedy algorithms for online survivable network design. In: ICALP, pp. 152:1\u2013152:14 (2018)"},{"issue":"3","key":"26_CR8","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1016\/j.jcss.2004.04.011","volume":"69","author":"J Fakcharoenphol","year":"2004","unstructured":"Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. J. Comput. Syst. Sci. 69(3), 485\u2013497 (2004)","journal-title":"J. Comput. Syst. Sci."},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Garg, N.: Saving an epsilon: a 2-approximation for the $$k$$-MST problem in graphs. In: STOC, pp. 396\u2013402 (2005)","DOI":"10.1145\/1060590.1060650"},{"issue":"1","key":"26_CR10","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1006\/jagm.2000.1096","volume":"37","author":"N Garg","year":"2000","unstructured":"Garg, N., Konjevod, G., Ravi, R.: A polylogarithmic approximation algorithm for the group Steiner tree problem. J. Algorithms 37(1), 66\u201384 (2000)","journal-title":"J. Algorithms"},{"key":"26_CR11","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. In: STOC, pp. 253\u2013264 (2019)"},{"key":"26_CR12","unstructured":"Guo, X., Laekhanukit, B., Li, S., Xian, J.: Tight approximation for variants of directed Steiner tree via state-tree decomposition and linear programming rounding. CoRR, abs\/1907.11404 (2019)"},{"key":"26_CR13","unstructured":"Hajiaghayi, M.T.: Open problems on bounded-degree network design. In: The Eighth Workshop on Flexible Network Design, Amsterdam (2016)"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Halperin, E., Krauthgamer, R.: Polylogarithmic inapproximability. In: STOC, pp. 585\u2013594 (2003)","DOI":"10.1145\/780542.780628"},{"issue":"1","key":"26_CR15","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1002\/1097-0037(200101)37:1<8::AID-NET2>3.0.CO;2-R","volume":"37","author":"CS Helvig","year":"2001","unstructured":"Helvig, C.S., Robins, G., Zelikovsky, A.: An improved approximation scheme for the group Steiner problem. Networks 37(1), 8\u201320 (2001)","journal-title":"Networks"},{"issue":"1","key":"26_CR16","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s004930170004","volume":"21","author":"K Jain","year":"2001","unstructured":"Jain, K.: A factor $$2$$ approximation algorithm for the generalized steiner network problem. Combinatorica 21(1), 39\u201360 (2001)","journal-title":"Combinatorica"},{"key":"26_CR17","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/S0166-218X(99)00111-0","volume":"93","author":"G Kortsarz","year":"1999","unstructured":"Kortsarz, G., Peleg, D.: Approximating the weight of shallow Steiner trees. Discrete Appl. Math. 93, 265\u2013285 (1999)","journal-title":"Discrete Appl. Math."},{"key":"26_CR18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511977152","volume-title":"Iterative Methods in Combinatorial Optimization","author":"LC Lau","year":"2011","unstructured":"Lau, L.C., Ravi, R., Singh, M.: Iterative Methods in Combinatorial Optimization. Cambridge University Press, New York (2011)"},{"key":"26_CR19","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, New York (1995)"},{"key":"26_CR20","doi-asserted-by":"crossref","unstructured":"Poplawski, L.J., Rajaraman, R.: Multicommodity facility location under group Steiner access cost. In: SODA, pp. 996\u20131013 (2011)","DOI":"10.1137\/1.9781611973082.77"},{"key":"26_CR21","doi-asserted-by":"crossref","unstructured":"Reed, B.: Finding approximate separators and computing tree width quickly. In: STOC, pp. 221\u2013228 (1992)","DOI":"10.1145\/129712.129734"},{"key":"26_CR22","first-page":"351","volume":"4","author":"N Sharma","year":"2014","unstructured":"Sharma, N., Kaur, M.: Survey of VLSI techniques for power optimization and estimation of optimization. Int. J. Emerg. Technol. Adv. Eng. 4, 351\u2013355 (2014)","journal-title":"Int. J. Emerg. Technol. Adv. Eng."},{"issue":"4","key":"26_CR23","doi-asserted-by":"publisher","first-page":"692","DOI":"10.1137\/0210052","volume":"10","author":"PJ Slater","year":"1981","unstructured":"Slater, P.J., Cockayne, E.J., Hedetniemi, S.T.: Information dissemination in trees. SIAM J. Comput. 10(4), 692\u2013701 (1981)","journal-title":"SIAM J. Comput."},{"key":"26_CR24","doi-asserted-by":"crossref","unstructured":"Wang, Y., Hong, X., Jing, T., Yang, Y., Hu, X., Yan, G.: An efficient low-degree RMST algorithm for VLSI\/ULSI physical design. In: PATMOS, pp. 442\u2013452 (2004)","DOI":"10.1007\/978-3-540-30205-6_46"},{"issue":"1","key":"26_CR25","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/BF02523690","volume":"18","author":"A Zelikovsky","year":"1997","unstructured":"Zelikovsky, A.: A series of approximation algorithms for the acyclic directed Steiner tree problem. Algorithmica 18(1), 99\u2013110 (1997)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-48966-3_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T15:17:22Z","timestamp":1710256642000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-48966-3_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030489656","9783030489663"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-48966-3_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"29 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bordeaux","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2020.labri.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,8","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5,9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference had to be postponed due to the COVID-19 pandemic","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}