{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:47:26Z","timestamp":1725493646084},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405344"},{"type":"electronic","value":"9783540450719"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45071-8_14","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T04:04:43Z","timestamp":1193457883000},"page":"122-129","source":"Crossref","is-referenced-by-count":16,"title":["On the Full and Bottleneck Full Steiner Tree Problems"],"prefix":"10.1007","author":[{"given":"Yen Hung","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chin Lung","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chuan Yi","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"14_CR1","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. Journal of Algorithms 17 (1994) 381\u2013408.","journal-title":"Journal of Algorithms"},{"key":"14_CR2","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 Journal on Computing 26 (1997) 857\u2013869.","journal-title":"SIAM Journal on Computing"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Caldwell, A., Kahng, A., Mantik, S., Markov, I., Zelikovsky, A.: On wirelength estimations for row-based placement. In: Proceedings of the 1998 International Symposium on Physical Design (ISPD 1998) 4\u201311.","DOI":"10.1145\/274535.274536"},{"key":"14_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0255-1","volume-title":"Steiner Tree in Industry","author":"X. Cheng","year":"2001","unstructured":"Cheng, X., Du, D.Z.: Steiner Tree in Industry. Kluwer Academic Publishers, Dordrecht, Netherlands (2001)."},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"1318","DOI":"10.1109\/43.62776","volume":"9","author":"C. Chiang","year":"1990","unstructured":"Chiang, C., Sarrafzadeh, M., Wong, C.K.: Global router based on Steiner min-max trees. IEEE Transaction on Computer-Aided Design 9 (1990) 1318\u20131325.","journal-title":"IEEE Transaction on Computer-Aided Design"},{"key":"14_CR6","volume-title":"Introduction to Algorithm","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithm. 2nd edition MIT Press, Cambridge (2001).","edition":"2nd edition"},{"key":"14_CR7","volume-title":"Advances in Steiner Tree","author":"D.Z. Du","year":"2000","unstructured":"Du, D.Z., Smith, J.M., Rubinstein, J.H.: Advances in Steiner Tree. Kluwer Academic Publishers, Dordrecht, Netherlands (2000)."},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/S0377-2217(96)00113-0","volume":"97","author":"C.W. Duin","year":"1997","unstructured":"Duin, C.W., Volgenant, A.: The partial sum criterion for Steiner trees in graphs and shortest paths. European Journal of Operations Research 97 (1997) 172\u2013182.","journal-title":"European Journal of Operations Research"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1137\/0132072","volume":"32","author":"M.R. Garey","year":"1997","unstructured":"Garey, M.R., Graham, R.L., Johnson, D.S.: The complexity of computing Steiner minimal trees. SIAM Journal of Applied Mathematics 32 (1997) 835\u2013859.","journal-title":"SIAM Journal of Applied Mathematics"},{"key":"14_CR10","volume-title":"Fundamentals of Molecular Evolution","author":"D. Graur","year":"2000","unstructured":"Graur, D., Li, W.H.: Fundamentals of Molecular Evolution. 2nd edition Sinauer Publishers, Sunderland, Massachusetts (2000).","edition":"2nd edition"},{"key":"14_CR11","unstructured":"Hougardy, S., Prommel, H.J.: A 1.598 approximation algorithm for the Steiner problem in graphs. In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1999) 448\u2013453."},{"key":"14_CR12","first-page":"53","volume-title":"Annuals of Discrete Mathematics","author":"F.K. Hwang","year":"1992","unstructured":"Hwang, F.K., Richards, D.S., Winter, P.: The Steiner Tree Problem. Annuals of Discrete Mathematics 53, Elsevier Science Publishers, Amsterdam (1992)."},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Kahng, A.B., Robins, G.: On Optimal Interconnections for VLSI. Kluwer Publishers (1995).","DOI":"10.1007\/978-1-4757-2363-2"},{"key":"14_CR14","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. Journal of Combinatorial Optimization 1 (1997) 47\u201365.","journal-title":"Journal of Combinatorial Optimization"},{"key":"14_CR15","unstructured":"Kim, J., Warnow, T.: Tutorial on Phylogenetic Tree Estimation. Manuscript, Department of Ecology and Evolutionary Biology, Yale University (1999)."},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/S0020-0190(02)00227-2","volume":"84","author":"G.H. Lin","year":"2002","unstructured":"Lin, G.H., Xue, G.L.: On the terminal Steiner tree problem. Information Processing Letters 84 (2002) 103\u2013107.","journal-title":"Information Processing Letters"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Lu, C.L., Tang, C.Y., Lee, R.C.T.: The full Steiner tree problem. Theoretical Computer Science (to appear).","DOI":"10.1016\/S0304-3975(03)00209-3"},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1006\/jagm.2000.1086","volume":"36","author":"H.J. Prommel","year":"2000","unstructured":"Prommel, H.J., Steger, A.: A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5\/3. Journal of Algorithms 36 (2000) 89\u2013101.","journal-title":"Journal of Algorithms"},{"key":"14_CR19","unstructured":"Robins, G., Zelikovsky A.: Improved Steiner tree approximation in graphs. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2000) 770\u2013779."},{"key":"14_CR20","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 (1993) 463\u2013470.","journal-title":"Algorithmica"},{"key":"14_CR21","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0020-0190(93)90201-J","volume":"46","author":"A. Zelikovsky","year":"1993","unstructured":"Zelikovsky, A.: A faster approximation algorithm for the Steiner tree problem in graphs. Information Processing Letters 46 (1993) 79\u201383.","journal-title":"Information Processing Letters"},{"key":"14_CR22","unstructured":"Zelikovsky, A.: Better approximation bounds for the network and Euclidean Steiner tree problems. Technical report CS-96-06, University of Virginia (1996)."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45071-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,14]],"date-time":"2023-05-14T10:58:31Z","timestamp":1684061911000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45071-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405344","9783540450719"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-45071-8_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}