{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T21:06:14Z","timestamp":1769979974692,"version":"3.49.0"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030416713","type":"print"},{"value":"9783030416720","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-41672-0_15","type":"book-chapter","created":{"date-parts":[[2020,2,20]],"date-time":"2020-02-20T02:03:04Z","timestamp":1582164184000},"page":"238-251","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An Efficient Approximation Algorithm for the Steiner Tree Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9664-8538","authenticated-orcid":false,"given":"Chi-Yeh","family":"Chen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4746-3179","authenticated-orcid":false,"given":"Sun-Yuan","family":"Hsieh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,2,21]]},"reference":[{"issue":"3","key":"15_CR1","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1137\/S0097539792236237","volume":"24","author":"A Agrawal","year":"1995","unstructured":"Agrawal, A., Klein, P., Ravi, R.: When trees collide: an approximation algorithm for the generalized steiner problem on networks. SIAM J. Comput. 24(3), 440\u2013456 (1995)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"15_CR2","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1137\/090771429","volume":"40","author":"A Archer","year":"2011","unstructured":"Archer, A., Bateni, M., Hajiaghayi, M., Karloff, H.: Improved approximation algorithms for prize-collecting steiner tree and TSP. SIAM J. Comput. 40(2), 309\u2013332 (2011)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"15_CR3","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1145\/290179.290180","volume":"45","author":"S Arora","year":"1998","unstructured":"Arora, S.: Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems. J. ACM 45(5), 753\u2013782 (1998)","journal-title":"J. ACM"},{"issue":"5","key":"15_CR4","doi-asserted-by":"publisher","first-page":"21:1","DOI":"10.1145\/2027216.2027219","volume":"58","author":"M Bateni","year":"2011","unstructured":"Bateni, M., Hajiaghayi, M., Marx, D.: Approximation schemes for steiner forest on planar graphs and graphs of bounded treewidth. J. ACM 58(5), 21:1\u201321:37 (2011)","journal-title":"J. ACM"},{"key":"15_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-642-03367-4_8","volume-title":"Algorithms and Data Structures","author":"P Berman","year":"2009","unstructured":"Berman, P., Karpinski, M., Zelikovsky, A.: 1.25-approximation algorithm for steiner tree problem with distances 1 and 2. In: Dehne, F., Gavrilova, M., Sack, J.-R., T\u00f3th, C.D. (eds.) WADS 2009. LNCS, vol. 5664, pp. 86\u201397. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-03367-4_8"},{"issue":"3","key":"15_CR6","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1006\/jagm.1994.1041","volume":"17","author":"P Berman","year":"1994","unstructured":"Berman, P., Ramaiyer, V.: Improved approximations for the steiner tree problem. J. Algorithms 17(3), 381\u2013408 (1994)","journal-title":"J. Algorithms"},{"issue":"4","key":"15_CR7","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0020-0190(89)90039-2","volume":"32","author":"M Bern","year":"1989","unstructured":"Bern, M., Plassmann, P.: The steiner problem with edge lengths 1 and 2. Inf. Process. Lett. 32(4), 171\u2013176 (1989)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"15_CR8","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1137\/S0097539795281086","volume":"26","author":"A Borchers","year":"1997","unstructured":"Borchers, A., Du, D.Z.: The k-steiner ratio in graphs. SIAM J. Comput. 26(3), 857\u2013869 (1997)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"15_CR9","doi-asserted-by":"publisher","first-page":"6:1","DOI":"10.1145\/2432622.2432628","volume":"60","author":"J Byrka","year":"2013","unstructured":"Byrka, J., Grandoni, F., Rothvoss, T., Sanit\u00e1, L.: Steiner tree approximation via iterative randomized rounding. J. ACM 60(1), 6:1\u20136:33 (2013)","journal-title":"J. ACM"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Caldwell, A.E., Kahng, A.B., Mantik, S., Markov, I.L., Zelikovsky, A.: On wirelength estimations for row-based placement. In: ISPD 1998: Proceedings of the 1998 International Symposium on Physical Design, pp. 4\u201311. ACM, New York, NY, USA (1998)","DOI":"10.1145\/274535.274536"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/3-540-45071-8_14","volume-title":"Computing and Combinatorics","author":"YH Chen","year":"2003","unstructured":"Chen, Y.H., Lu, C.L., Tang, C.Y.: On the full and bottleneck full steiner tree problems. In: Warnow, T., Zhu, B. (eds.) COCOON 2003. LNCS, vol. 2697, pp. 122\u2013129. Springer, Heidelberg (2003). \nhttps:\/\/doi.org\/10.1007\/3-540-45071-8_14"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-642-21931-3_12","volume-title":"Computational Science and Its Applications - ICCSA 2011","author":"YH Chen","year":"2011","unstructured":"Chen, Y.H.: An improved approximation algorithm for the terminal steiner tree problem. In: Murgante, B., Gervasi, O., Iglesias, A., Taniar, D., Apduhan, B.O. (eds.) ICCSA 2011, Part III. LNCS, vol. 6784, pp. 141\u2013151. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-21931-3_12"},{"issue":"3","key":"15_CR13","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.tcs.2008.06.046","volume":"406","author":"M Chleb\u00edk","year":"2008","unstructured":"Chleb\u00edk, M., Chleb\u00edkov\u00e1, J.: The steiner tree problem on graphs: Inapproximability results. Theor. Comput. Sci. 406(3), 207\u2013214 (2008). Algorithmic Aspects of Global Computing","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"15_CR14","doi-asserted-by":"publisher","first-page":"13:1","DOI":"10.1145\/2601070","volume":"10","author":"ED Demaine","year":"2013","unstructured":"Demaine, E.D., Hajiaghayi, M., Klein, P.N.: Node-weighted steiner tree and group steiner tree in planar graphs. ACM Trans. Algorithms 10(3), 13:1\u201313:20 (2013)","journal-title":"ACM Trans. Algorithms"},{"issue":"1","key":"15_CR15","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.ipl.2003.09.014","volume":"89","author":"DE Drake","year":"2004","unstructured":"Drake, D.E., Hougardy, S.: On approximation algorithms for the terminal steiner tree problem. Inf. Process. Lett. 89(1), 15\u201318 (2004)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"15_CR16","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/s10107-016-0987-5","volume":"160","author":"AE Feldmann","year":"2016","unstructured":"Feldmann, A.E., K\u00f6nemann, J., Olver, N., Sanit\u00e0, L.: On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree. Math. Program. 160(1), 379\u2013406 (2016)","journal-title":"Math. Program."},{"issue":"4","key":"15_CR17","doi-asserted-by":"publisher","first-page":"1176","DOI":"10.1137\/040610891","volume":"17","author":"CE Ferreira","year":"2006","unstructured":"Ferreira, C.E., de Oliveira Filho, F.M.: New reduction techniques for the group steiner tree problem. SIAM J. Optim. 17(4), 1176\u20131188 (2006)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"15_CR18","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/S0020-0190(03)00285-0","volume":"87","author":"B Fuchs","year":"2003","unstructured":"Fuchs, B.: A note on the terminal steiner tree problem. Inf. Process. Lett. 87(4), 219\u2013220 (2003)","journal-title":"Inf. Process. Lett."},{"key":"15_CR19","volume-title":"Computers and Intractability","author":"MR Garey","year":"2002","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, vol. 29. W.H. Freeman, New York (2002)"},{"key":"15_CR20","unstructured":"Garg, N., Konjevod, G., Ravi, R.: A polylogarithmic approximation algorithm for the group Steiner tree problem. In: Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1998, pp. 253\u2013259. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (1998)"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Goemans, M.X., Olver, N., Rothvo\u00df, T., Zenklusen, R.: Matroids and integrality gaps for hypergraphic steiner tree relaxations. In: Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing,TOC 2012, pp. 1161\u20131176. ACM, New York, NY, USA (2012)","DOI":"10.1145\/2213977.2214081"},{"issue":"5","key":"15_CR22","doi-asserted-by":"publisher","first-page":"1494","DOI":"10.1137\/S0097539704445718","volume":"36","author":"E Halperin","year":"2007","unstructured":"Halperin, E., Kortsarz, G., Krauthgamer, R., Srinivasan, A., Wang, N.: Integrality ratio for group Steiner trees and directed steiner trees. SIAM J. Comput. 36(5), 1494\u20131511 (2007)","journal-title":"SIAM J. Comput."},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Halperin, E., Krauthgamer, R.: Polylogarithmic inapproximability. In: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, STOC 2003, pp. 585\u2013594. ACM, New York, NY, USA (2003)","DOI":"10.1145\/780542.780628"},{"key":"15_CR24","unstructured":"Hougardy, S., Pr\u00f6mel, H.J.: A 1.598 approximation algorithm for the Steiner problem in graphs. In: SODA 1999: Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 448\u2013453. Society for Industrial and Applied Mathematics, Philadelphia, ACM, New York (1999)"},{"issue":"1","key":"15_CR25","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s11227-007-0102-z","volume":"41","author":"SY Hsieh","year":"2007","unstructured":"Hsieh, S.Y., Gao, H.M.: On the partial terminal Steiner tree problem. J. Supercomput. 41(1), 41\u201352 (2007)","journal-title":"J. Supercomput."},{"key":"15_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-540-72504-6_25","volume-title":"Theory and Applications of Models of Computation","author":"S-Y Hsieh","year":"2007","unstructured":"Hsieh, S.-Y., Gao, H.-M., Yang, S.-C.: On the internal Steiner tree problem. In: Cai, J.-Y., Cooper, S.B., Zhu, H. (eds.) TAMC 2007. LNCS, vol. 4484, pp. 274\u2013283. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-72504-6_25"},{"issue":"1","key":"15_CR27","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.jco.2012.08.005","volume":"29","author":"CW Huang","year":"2013","unstructured":"Huang, C.W., Lee, C.W., Gao, H.M., Hsieh, S.Y.: The internal Steiner tree problem: hardness and approximations. J. Complex. 29(1), 27\u201343 (2013)","journal-title":"J. Complex."},{"key":"15_CR28","series-title":"Annuals of Discrete Mathematics","volume-title":"The Steiner Tree Problem","author":"FK Hwang","year":"1992","unstructured":"Hwang, F.K., Richards, D.S., Winter, P.: The Steiner Tree Problem. Annuals of Discrete Mathematics, vol. 53. Elsevier Science Publishers, Amsterdam (1992)"},{"key":"15_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2363-2","volume-title":"On Optimal Interconnections for VLSI","author":"AB Kahng","year":"1995","unstructured":"Kahng, A.B., Robins, G.: On Optimal Interconnections for VLSI. Kluwer Academic, Boston (1995)"},{"key":"15_CR30","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1023\/A:1009758919736","volume":"1","author":"M Karpinski","year":"1997","unstructured":"Karpinski, M., Zelikovsky, A.: New approximation algorithms for the Steiner tree problems. J. Comb. Optim. 1, 47\u201365 (1997)","journal-title":"J. Comb. Optim."},{"key":"15_CR31","unstructured":"Korte, B., Pr\u00f6mel, H.J., Steger, A.: Steiner trees in VLSI-layout. Paths, Flows, and VLSI-Layout, pp. 185\u2013214 (1990)"},{"key":"15_CR32","doi-asserted-by":"crossref","unstructured":"Liang, W.: Constructing minimum-energy broadcast trees in wireless ad hoc networks. In: Proceedings of the 3rd ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2002, pp. 112\u2013122. ACM, New York, NY, USA (2002)","DOI":"10.1145\/513800.513815"},{"issue":"2","key":"15_CR33","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/S0020-0190(02)00227-2","volume":"84","author":"GH Lin","year":"2002","unstructured":"Lin, G.H., Xue, G.L.: On the terminal steiner tree problem. Inf. Process. Lett. 84(2), 103\u2013107 (2002)","journal-title":"Inf. Process. Lett."},{"issue":"1\u20133","key":"15_CR34","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/S0304-3975(03)00209-3","volume":"306","author":"CL Lu","year":"2003","unstructured":"Lu, C.L., Tang, C.Y., Lee, R.C.T.: The full Steiner tree problem. Theor. Comput. Sci. 306(1\u20133), 55\u201367 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u2014-2","key":"15_CR35","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.tcs.2007.08.001","volume":"389","author":"FV Martinez","year":"2007","unstructured":"Martinez, F.V., de Pina, J.C., Soares, J.: Algorithms for terminal Steiner trees. J. Theor. Comput. Sci. 389(1\u2014-2), 133\u2013142 (2007)","journal-title":"J. Theor. Comput. Sci."},{"issue":"1","key":"15_CR36","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s10898-005-8466-1","volume":"35","author":"M Min","year":"2006","unstructured":"Min, M., Du, H., Jia, X., Huang, C.X., Huang, S.C.H., Wu, W.: Improving construction for connected dominating set with Steiner tree in wireless sensor networks. J. Glob. Optim. 35(1), 111\u2013119 (2006)","journal-title":"J. Glob. Optim."},{"key":"15_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/BFb0023489","volume-title":"STACS 97","author":"HJ Pr\u00f6mel","year":"1997","unstructured":"Pr\u00f6mel, H.J., Steger, A.: RNC-approximation algorithms for the steiner problem. In: Reischuk, R., Morvan, M. (eds.) STACS 1997. LNCS, vol. 1200, pp. 559\u2013570. Springer, Heidelberg (1997). \nhttps:\/\/doi.org\/10.1007\/BFb0023489"},{"issue":"1","key":"15_CR38","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. Discrete Math. 19(1), 122\u2013134 (2005)","journal-title":"SIAM J. Discrete Math."},{"key":"15_CR39","first-page":"573","volume":"24","author":"H Takahashi","year":"1980","unstructured":"Takahashi, H., Matsuyama, A.: An approximate solution for the Steiner problem in graphs. Math. Jpn. 24, 573\u2013577 (1980)","journal-title":"Math. Jpn."},{"issue":"5","key":"15_CR40","doi-asserted-by":"publisher","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 9(5), 463\u2013470 (1993)","journal-title":"Algorithmica"},{"key":"15_CR41","unstructured":"Zelikovsky, A.: Better approximation bounds for the network and euclidean Steiner tree problems. In: Technical report CS-96-06. University of Virginia. Charlottesville, VA, USA (1996)"}],"container-title":["Lecture Notes in Computer Science","Complexity and Approximation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-41672-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,20]],"date-time":"2020-02-20T02:05:55Z","timestamp":1582164355000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-41672-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030416713","9783030416720"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-41672-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"21 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}