{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:23:42Z","timestamp":1759638222304},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,7,4]],"date-time":"2015-07-04T00:00:00Z","timestamp":1435968000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2016,11]]},"DOI":"10.1007\/s10878-015-9925-3","type":"journal-article","created":{"date-parts":[[2015,7,3]],"date-time":"2015-07-03T11:25:21Z","timestamp":1435922721000},"page":"1089-1106","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Directed Steiner trees with diffusion costs"],"prefix":"10.1007","volume":"32","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","published-online":{"date-parts":[[2015,7,4]]},"reference":[{"key":"9925_CR1","unstructured":"Charikar M, Chekuri C, Cheung T, Dai Z (1998) Approximation algorithms for directed Steiner problems. In: Proceedings of SODA, pp 192\u2013200"},{"key":"9925_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0255-1","volume-title":"Steiner trees in industry","author":"X Cheng","year":"2001","unstructured":"Cheng X, Du D-Z (2001) Steiner trees in industry, vol 11. Kluwer, Dordrecht"},{"key":"9925_CR3","doi-asserted-by":"crossref","unstructured":"Ding B, Yu JX, Wang S, Qin L (2007) Finding top-k min-cost connected trees in databases. In: ICDE, pp 836\u2013845","DOI":"10.1109\/ICDE.2007.367929"},{"key":"9925_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized complexity. Monographs in computer science","author":"R Downey","year":"1999","unstructured":"Downey R, Fellows M (1999) Parameterized complexity. Monographs in computer science. Springer, Berlin"},{"issue":"3","key":"9925_CR5","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1002\/net.3230010302","volume":"1","author":"SE Dreyfus","year":"1971","unstructured":"Dreyfus SE, Wagner RA (1971) The Steiner problem in graphs. Networks 1(3):195\u2013207","journal-title":"Networks"},{"key":"9925_CR6","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/s10878-005-2273-y","volume":"10","author":"H Du","year":"2005","unstructured":"Du H, Jia X, Wang F, Thai MY, Li Y (2005) A note on optical network with nonsplitting nodes. JCO 10:199\u2013202","journal-title":"JCO"},{"issue":"4","key":"9925_CR7","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige U (1998) A threshold of ln n for approximating set cover. JACM 45(4):634\u2013652","journal-title":"JACM"},{"issue":"6","key":"9925_CR8","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"R Floyd","year":"1962","unstructured":"Floyd R (1962) Algorithm 97: shortest path. Commun ACM 5(6):345","journal-title":"Commun ACM"},{"key":"9925_CR9","doi-asserted-by":"crossref","unstructured":"Gargano L, Hell P, Stacho L, Vaccaro U (2002) Spanning trees with bounded number of branch vertices. In: Proceedings of ICALP, pp 355\u2013365","DOI":"10.1007\/3-540-45465-9_31"},{"issue":"4","key":"9925_CR10","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/s10878-005-4925-3","volume":"10","author":"L Guo","year":"2005","unstructured":"Guo L, Wu W, Wang F, Thai M (2005) An approximation for minimum multicast route in optical networks with nonsplitting nodes. J Comb Optim 10(4):391\u2013394","journal-title":"J Comb Optim"},{"key":"9925_CR11","doi-asserted-by":"crossref","unstructured":"Halperin E, Krauthgamer R (2003) Polylogarithmic inapproximability. In Proceedings of the 35th ACM symposium on theory of computing (STOC), ACM, New York, pp 585\u2013594","DOI":"10.1145\/780542.780628"},{"issue":"1","key":"9925_CR12","doi-asserted-by":"crossref","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 CS, Robins G, Zelikovsky A (2001) An improved approximation scheme for the group Steiner problem. Networks 37(1):8\u201320","journal-title":"Networks"},{"key":"9925_CR13","doi-asserted-by":"crossref","unstructured":"Jones M, Lokshtanov D, Ramanujan M, Saurabh S, Suchy O (2013) Parameterized complexity of directed Steiner tree on sparse graphs. In: Proceedings of ESA, pp 671\u2013682","DOI":"10.1007\/978-3-642-40450-4_57"},{"key":"9925_CR14","doi-asserted-by":"crossref","unstructured":"Karp R (1972) Reducibility among combinatorial problems. In: Complexity of computer computations. The IBM research symposia series, Springer, New York, pp 85\u2013103","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"9925_CR15","doi-asserted-by":"crossref","unstructured":"Koch T, Martin A, Vo\u00df S (2001) SteinLib: an updated library on Steiner tree problems in graphs. In: Combinatorial optimization, vol 11, Springer, New York, pp 285\u2013325","DOI":"10.1007\/978-1-4613-0255-1_9"},{"key":"9925_CR16","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00288961","volume":"15","author":"L Kou","year":"1981","unstructured":"Kou L, Markowsky G, Berman L (1981) A fast algorithm for Steiner trees. Acta Inf 15:141\u2013145","journal-title":"Acta Inf"},{"key":"9925_CR17","unstructured":"Lin H-c, Wang S-w (2005) Splitter placement in all-optical WDM networks. Global telecommunications conference"},{"key":"9925_CR18","doi-asserted-by":"crossref","unstructured":"Malli R, Zhang X, Qiao C (1998) Benefit of multicasting in all-optical networks. In: Proceedings of the SPIE conference on all-optical networking","DOI":"10.1117\/12.327060"},{"issue":"12","key":"9925_CR19","doi-asserted-by":"crossref","first-page":"1149","DOI":"10.1016\/S0305-0548(00)00029-0","volume":"28","author":"R Novak","year":"2001","unstructured":"Novak R (2001) A note on distributed multicast routing in point-to-point networks. Comput Oper Res 28(12):1149\u20131164","journal-title":"Comput Oper Res"},{"issue":"8","key":"9925_CR20","doi-asserted-by":"crossref","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 (2012) Optimal configuration of an optical network providing predefined multicast transmissions. Comput Netw 56(8):2097\u20132106","journal-title":"Comput Netw"},{"key":"9925_CR21","doi-asserted-by":"crossref","unstructured":"Reinhard V, Tomasik J, Barth D, Weisser M-A (2009) Bandwidth optimization for multicast transmissions in virtual circuit networks. IFIP networking, pp 859\u2013870","DOI":"10.1007\/978-3-642-01399-7_67"},{"key":"9925_CR22","unstructured":"Robins G, Zelikovsky A (2000) Improved Steiner tree approximation in graphs. In Proceedings of the SODA, pp 770\u2013779"},{"key":"9925_CR23","unstructured":"Rugeli J, Novak R (1995) Steiner tree algorithms for multicast protocols. Manuscript"},{"issue":"3","key":"9925_CR24","doi-asserted-by":"crossref","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 (2003) The Steiner cycle polytope. Eur J Oper Res 147(3):671\u2013679","journal-title":"Eur J Oper Res"},{"key":"9925_CR25","first-page":"1349","volume":"29","author":"M Steinov\u00e1","year":"2010","unstructured":"Steinov\u00e1 M (2010) Approximability of the minimum Steiner cycle problem. Comput Inform 29:1349\u20131357","journal-title":"Comput Inform"},{"issue":"1","key":"9925_CR26","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1002\/net.3230070103","volume":"7","author":"R Tarjan","year":"1977","unstructured":"Tarjan R (1977) Finding optimum branchings. Networks 7(1):25\u201335","journal-title":"Networks"},{"key":"9925_CR27","doi-asserted-by":"crossref","unstructured":"Vo\u00df S (2006) Steiner tree problems in telecommunications. In: Handbook of optimization in telecommunications, Springer, New York, pp 459\u2013492","DOI":"10.1007\/978-0-387-30165-5_18"},{"key":"9925_CR28","doi-asserted-by":"crossref","unstructured":"Watel D, Weisser M, Bentz C, Barth D (2013) Steiner problems with limited number of branching nodes. In: Proceedings of SIROCCO, pp 310\u2013321","DOI":"10.1007\/978-3-319-03578-9_26"},{"key":"9925_CR29","doi-asserted-by":"crossref","unstructured":"Watel D, Weisser M, Bentz C, Barth D (2014) Directed Steiner tree with branching constraint. In: Proceedings of COCOON, pp 263\u2013275","DOI":"10.1007\/978-3-319-08783-2_23"},{"issue":"1","key":"9925_CR30","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF02523690","volume":"18","author":"A Zelikovsky","year":"1997","unstructured":"Zelikovsky A (1997) A series of approximation algorithms for the acyclic directed Steiner tree problem. Algorithmica 18(1):99\u2013110","journal-title":"Algorithmica"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9925-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9925-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9925-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9925-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,11]],"date-time":"2023-08-11T23:51:05Z","timestamp":1691797865000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9925-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,4]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,11]]}},"alternative-id":["9925"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9925-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,7,4]]}}}