{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:56:39Z","timestamp":1725796599557},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319087825"},{"type":"electronic","value":"9783319087832"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08783-2_23","type":"book-chapter","created":{"date-parts":[[2014,7,5]],"date-time":"2014-07-05T14:04:30Z","timestamp":1404569070000},"page":"263-275","source":"Crossref","is-referenced-by-count":2,"title":["Directed Steiner Tree with Branching Constraint"],"prefix":"10.1007","author":[{"given":"Dimitri","family":"Watel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc-Antoine","family":"Weisser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C\u00e9dric","family":"Bentz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominique","family":"Barth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Cheng, X., Du, D.Z.: Steiner trees in industry, vol.\u00a011. Kluwer (2001)","DOI":"10.1007\/978-1-4613-0255-1"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Vo\u00df, S.: Steiner tree problems in telecommunications. In: Handbook of Optimization in Telecommunications, pp. 459\u2013492 (January 2006)","DOI":"10.1007\/978-0-387-30165-5_18"},{"key":"23_CR3","unstructured":"Rugeli, J., Novak, R.: Steiner tree algorithms for multicast protocols (1995)"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Novak, R.: A note on distributed multicast routing in point-to-point networks. Computers & Operations Research, 1149\u20131164 (October 2001)","DOI":"10.1016\/S0305-0548(00)00029-0"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Karp, R.: Reducibility among combinatorial problems. Springer (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Kou, L., Markowsky, G., Berman, L.: A fast algorithm for Steiner trees. Acta Informatica, 141\u2013145 (1981)","DOI":"10.1007\/BF00288961"},{"key":"23_CR7","unstructured":"Robins, G., Zelikovsky, A.: Improved Steiner tree approximation in graphs. In: Proc. SODA, pp. 770\u2013779 (2000)"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. JACM, 634\u2013652 (1998)","DOI":"10.1145\/285055.285059"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Halperin, E., Krauthgamer, R.: Polylogarithmic inapproximability. In: Proc. STOC, pp. 585\u2013594. ACM (2003)","DOI":"10.1145\/780542.780628"},{"key":"23_CR10","unstructured":"Charikar, M., Chekuri, C., Cheung, T., Dai, Z.: Approximation algorithms for directed Steiner problems. In: Proc. SODA, pp. 192\u2013200 (1998)"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Zelikovsky, A.: A series of approximation algorithms for the acyclic directed Steiner tree problem. Algorithmica, 99\u2013110 (1997)","DOI":"10.1007\/BF02523690"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Helvig, C., Robins, G., Zelikovsky, A.: An improved approximation scheme for the group Steiner problem. Networks (2001)","DOI":"10.1002\/1097-0037(200101)37:1<8::AID-NET2>3.0.CO;2-R"},{"issue":"3","key":"23_CR13","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1002\/net.3230010302","volume":"1","author":"S.E. Dreyfus","year":"1971","unstructured":"Dreyfus, S.E., Wagner, R.A.: The steiner problem in graphs. Networks\u00a01(3), 195\u2013207 (1971)","journal-title":"Networks"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Ding, B., Yu, J.X., Wang, S., Qin, L.: Finding top-k min-cost connected trees in databases. In: ICDE (2007)","DOI":"10.1109\/ICDE.2007.367929"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized complexity. Monographs in computer science edn. Springer (1999)","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"23_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1007\/978-3-642-40450-4_57","volume-title":"Algorithms \u2013 ESA 2013","author":"M. Jones","year":"2013","unstructured":"Jones, M., Lokshtanov, D., Ramanujan, M.S., Saurabh, S., Such\u00fd, O.: Parameterized complexity of directed steiner tree on sparse graphs. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol.\u00a08125, pp. 671\u2013682. Springer, Heidelberg (2013)"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Malli, R., Zhang, X., Qiao, C.: Benefit of Multicasting in All-Optical Networks. In: SPIE Proc. Conf. All-Optical Networking (1998)","DOI":"10.1117\/12.327060"},{"key":"23_CR18","unstructured":"Lin, H.-c., Wang, S.-W.: Splitter Placement in All-Optical WDM Networks. In: Global Telecommunications Conference (2005)"},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Du, H., Jia, X., Wang, F., Thai, M.Y., Li, Y.: A Note on Optical Network with Nonsplitting Nodes. JCO (2005)","DOI":"10.1007\/s10878-005-2273-y"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Guo, L., Wu, W., Wang, F., Thai, M.: Approximation for Minimum Multicast Route in Optical Network with Nonsplitting Nodes. JCO (2005)","DOI":"10.1007\/s10878-005-4925-3"},{"key":"23_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1007\/978-3-642-01399-7_67","volume-title":"NETWORKING 2009","author":"V. Reinhard","year":"2009","unstructured":"Reinhard, V., Tomasik, J., Barth, D., Weisser, M.-A.: Bandwidth Optimization for Multicast Transmissions in Virtual Circuit Networks. In: Fratta, L., Schulzrinne, H., Takahashi, Y., Spaniol, O. (eds.) NETWORKING 2009. LNCS, vol.\u00a05550, pp. 859\u2013870. Springer, Heidelberg (2009)"},{"issue":"8","key":"23_CR22","doi-asserted-by":"publisher","first-page":"2097","DOI":"10.1016\/j.comnet.2012.02.005","volume":"56","author":"V. Reinhard","year":"2012","unstructured":"Reinhard, V., Cohen, J., Tomasik, J., Barth, D., Weisser, M.A.: Optimal configuration of an optical network providing predefined multicast transmissions. Comput. Netw.\u00a056(8), 2097\u20132106 (2012)","journal-title":"Comput. Netw."},{"key":"23_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-319-03578-9_26","volume-title":"Structural Information and Communication Complexity","author":"D. Watel","year":"2013","unstructured":"Watel, D., Weisser, M.-A., Bentz, C., Barth, D.: Steiner Problems with Limited Number of Branching Nodes. In: Moscibroda, T., Rescigno, A.A. (eds.) SIROCCO 2013. LNCS, vol.\u00a08179, pp. 310\u2013321. Springer, Heidelberg (2013)"},{"key":"23_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/3-540-45465-9_31","volume-title":"Automata, Languages and Programming","author":"L. Gargano","year":"2002","unstructured":"Gargano, L., Hell, P., Stacho, L., Vaccaro, U.: Spanning trees with bounded number of branch vertices. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 355\u2013365. Springer, Heidelberg (2002)"},{"issue":"3","key":"23_CR25","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1016\/S0377-2217(02)00359-4","volume":"147","author":"J.J. Salazar-Gonz\u00e1lez","year":"2003","unstructured":"Salazar-Gonz\u00e1lez, J.J.: The Steiner cycle polytope. European Journal of Operational Research\u00a0147(3), 671\u2013679 (2003)","journal-title":"European Journal of Operational Research"},{"key":"23_CR26","unstructured":"Steinov\u00e1, M.: Approximability of the Minimum Steiner Cycle Problem (2010)"},{"issue":"1","key":"23_CR27","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1002\/net.3230070103","volume":"7","author":"R. Tarjan","year":"1977","unstructured":"Tarjan, R.: Finding optimum branchings. Networks\u00a07(1), 25\u201335 (1977)","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08783-2_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T07:17:20Z","timestamp":1558941440000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08783-2_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319087825","9783319087832"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08783-2_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}