{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T20:56:13Z","timestamp":1648760173459},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,11,28]],"date-time":"2014-11-28T00:00:00Z","timestamp":1417132800000},"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 Syst Sci Complex"],"published-print":{"date-parts":[[2015,8]]},"DOI":"10.1007\/s11424-014-2120-2","type":"journal-article","created":{"date-parts":[[2014,12,2]],"date-time":"2014-12-02T13:48:33Z","timestamp":1417528113000},"page":"876-886","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Definition and algorithms for reliable steiner tree problem"],"prefix":"10.1007","volume":"28","author":[{"given":"Yaohua","family":"Tang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenguo","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tiande","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,11,28]]},"reference":[{"key":"2120_CR1","volume-title":"Reducibility Among Combinatorial Problems","author":"R. M. Karp","year":"1972","unstructured":"Karp R M, Reducibility Among Combinatorial Problems, Springer US, 1972."},{"issue":"6","key":"2120_CR2","first-page":"573","volume":"24","author":"H. Takahashi","year":"1980","unstructured":"Takahashi H and Matsuyama A, An approximate solution for the Steiner problem in graphs, Math. Jap., 1980, 24(6): 573\u2013577.","journal-title":"Math. Jap."},{"key":"2120_CR3","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/BF01187035","volume":"9","author":"A. Zelikovsky","year":"1993","unstructured":"Zelikovsky A, An 11\/6-approximation algorithm for the network Steiner problem, Algorithmica, 1993, 9: 463\u2013470.","journal-title":"Algorithmica"},{"key":"2120_CR4","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1006\/jagm.1994.1041","volume":"17","author":"P. Berman","year":"1994","unstructured":"Berman P and Ramaiyer V, Improved approximations for the Steiner tree problem, Journal of Algorithms, 1994, 17: 381\u2013408.","journal-title":"Journal of Algorithms"},{"key":"2120_CR5","volume-title":"Better approximation bounds for the network and Euclidean Steiner tree problems, Technical report CS-96-06, University of Virginia","author":"A. Zelikovsky","year":"1995","unstructured":"Zelikovsky A, Better approximation bounds for the network and Euclidean Steiner tree problems, Technical report CS-96-06, University of Virginia, 1995."},{"key":"2120_CR6","volume-title":"Proceedings of STACS 97","author":"H. J. Pr\u00d6mel","year":"1997","unstructured":"Pr\u00d6mel H J and Steger A, RNC-approximation algorithms for the Steiner problem, Proceedings of STACS 97, Springer Berlin Heidelberg, 1997."},{"key":"2120_CR7","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1023\/A:1009758919736","volume":"1","author":"M. Karpinski","year":"1997","unstructured":"Karpinski M and Zelikovsky A, New approximation algorithms for the Steiner tree problems, J. of Combinatorial Optimization, 1997, 1: 47\u201365.","journal-title":"J. of Combinatorial Optimization"},{"key":"2120_CR8","volume-title":"Proceedings of SODA","author":"S. Hougardy","year":"1999","unstructured":"Hougardy S and Pr\u00d6mel H J, A 1.598 approximation algorithm for the Steiner problem in graphs, Proceedings of SODA, Society for Industrial and Applied Mathematics, 1999."},{"issue":"1","key":"2120_CR9","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1137\/S0895480101393155","volume":"19","author":"G. Robins","year":"2005","unstructured":"Robins G and Zelikovsky A, Tighter bounds for graph Steiner tree approximation, SIAM J. Discrete Math, 2005, 19(1): 122\u2013134.","journal-title":"SIAM J. Discrete Math"},{"key":"2120_CR10","volume-title":"Proceedings of the 42nd ACM symposium on Theory of computing","author":"G. Byrka J","year":"2010","unstructured":"Byrka J, Grandoni, Fabrizio F, Rothvo\u03b2 T, and Sanit\u00e0 L, An improved LP-based approximation for Steiner tree, Proceedings of the 42nd ACM symposium on Theory of computing, ACM, 2010."},{"key":"2120_CR11","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1002\/net.3230010302","volume":"1","author":"S. E. Dreyfus","year":"1972","unstructured":"Dreyfus S E and Wagner R A, The Steiner problem in graphs, Networks, 1972, 1: 195\u2013207.","journal-title":"Networks"},{"issue":"4","key":"2120_CR12","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1002\/rsa.3240050405","volume":"5","author":"L. L. Deneen","year":"1994","unstructured":"Deneen L L, Shute G M, and Thomborson C D, A probably fast, provably optimal algorithm for rectilinear Steiner trees, Random Structures and Algorithms, 1994, 5(4): 535\u2013557.","journal-title":"Random Structures and Algorithms"},{"issue":"1\u20133","key":"2120_CR13","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/S0166-218X(98)00089-4","volume":"90","author":"J. L. Ganley","year":"1999","unstructured":"Ganley J L, Computing optimal rectilinear Steiner trees: A survey and experimental evaluation, Discrete Applied Mathematics, 1999, 90(1\u20133): 161\u2013171.","journal-title":"Discrete Applied Mathematics"},{"key":"2120_CR14","volume-title":"Proceedings of the 9th Workshop on Algorithms and Data Structures (WADS)","author":"J. Guo","year":"2005","unstructured":"Guo J, Niedermeier R, and Wernicke S, Parameterized complexity of generalized vertex cover problems, Proceedings of the 9th Workshop on Algorithms and Data Structures (WADS), Springer, Berlin Heidelberg, 2005."},{"key":"2120_CR15","volume-title":"Languages and Programming","author":"G. E. Blelloch","year":"2006","unstructured":"Blelloch G E, Dhamdhere K, Halperin E, Ravi R, Schwartz R, and Sridhar S, Fixed parameter tractability of binary near-perfect phylogenetic tree reconstruction, Automata, Languages and Programming, Springer, Berlin Heidelberg, 2006."},{"key":"2120_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/11672142_46","volume-title":"A Faster Algorithm for the Steiner Tree Problem","author":"D. M\u00d6lle","year":"2006","unstructured":"M\u00d6lle D, Richter S, and Rossmanith P, A Faster Algorithm for the Steiner Tree Problem, Springer, Berlin Heidelberg, 2006."},{"key":"2120_CR17","volume-title":"Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing","author":"A. Bj\u00d6rklund","year":"2007","unstructured":"Bj\u00d6rklund A, Husfeldt T, Kaski P, and Koivisto M, Fourier meets M\u00d6bious, fast subset convolution, Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, New York, 2007."},{"key":"2120_CR18","volume-title":"Proceedings of IMECS","author":"Y. Tang","year":"2013","unstructured":"Tang Y, Yang W, and Guo T, Fast partial subset convolution for Steiner Tree Problem, Proceedings of IMECS, Hong Kong, 2013."},{"key":"2120_CR19","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/s004539910005","volume":"26","author":"U. F\u00d6\u03b2eier","year":"2000","unstructured":"F\u00d6\u03b2eier U and Kaufmann M, On exact solutions for the rectilinear Steiner tree problem Part 1: Theoretical results, Algorithmica, 2000, 26: 68\u20139.","journal-title":"Algorithmica"}],"container-title":["Journal of Systems Science and Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-014-2120-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11424-014-2120-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11424-014-2120-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T14:54:06Z","timestamp":1559400846000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11424-014-2120-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,28]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,8]]}},"alternative-id":["2120"],"URL":"https:\/\/doi.org\/10.1007\/s11424-014-2120-2","relation":{},"ISSN":["1009-6124","1559-7067"],"issn-type":[{"value":"1009-6124","type":"print"},{"value":"1559-7067","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11,28]]}}}