{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:20:20Z","timestamp":1725571220669},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642174605"},{"type":"electronic","value":"9783642174612"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17461-2_20","type":"book-chapter","created":{"date-parts":[[2010,12,15]],"date-time":"2010-12-15T04:53:59Z","timestamp":1292388839000},"page":"243-253","source":"Crossref","is-referenced-by-count":3,"title":["Diameter-Constrained Steiner Tree"],"prefix":"10.1007","author":[{"given":"Wei","family":"Ding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guohui","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guoliang","family":"Xue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/3-540-46521-9_2","volume-title":"Algorithms and Complexity","author":"N. Deo","year":"2000","unstructured":"Deo, N., Abdalla, A.: Computing a Diameter-Constrained Minimum Spanning Tree in Parallel. In: Bongiovanni, G., Petreschi, R., Gambosi, G. (eds.) CIAC 2000. LNCS, vol.\u00a01767, pp. 17\u201331. Springer, Heidelberg (2000)"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Ding, W., Xue, G.: A Linear Time Algorithm for Computing a Most Reliable Source on a Tree Network with Faulty Nodes. Theor. Comput. Sci. (2009), doi:10.1016\/j.tcs.2009.08.003","DOI":"10.1016\/j.tcs.2009.08.003"},{"key":"20_CR3","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.ipl.2003.09.014","volume":"89","author":"D.E. Drake","year":"2004","unstructured":"Drake, D.E., Hougrady, S.: On Approximation Algorithms for the Terminal Steiner Tree Problem. Information Processing Letters\u00a089, 15\u201318 (2004)","journal-title":"Information Processing Letters"},{"key":"20_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3171-2","volume-title":"Advances in Steiner Trees","author":"D.Z. Du","year":"2000","unstructured":"Du, D.Z., Smith, J.M., Rubinstein, J.H.: Advances in Steiner Trees. Kluwer Academic Publishers, Dordrecht (2000)"},{"key":"20_CR5","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. Information Processing Letters\u00a087, 219\u2013220 (2003)","journal-title":"Information Processing Letters"},{"key":"20_CR6","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"key":"20_CR7","unstructured":"Gouveia, L., Magnanti, T.L.: Network Flow Models for Designing Diameter-Constrained Minimum Spanning and Steiner Trees. In: Operations Research Center Working Papers. Operations Research Center, Massachusetts Institute of Technology (2001)"},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1287\/moor.17.1.36","volume":"17","author":"R. Hassin","year":"1992","unstructured":"Hassin, R.: Approximation Schemes for the Restricted Shortest Path Problem. Mathematics of Operations Research\u00a017, 36\u201342 (1992)","journal-title":"Mathematics of Operations Research"},{"key":"20_CR9","unstructured":"Hwang, F.K., Richards, D.S., Winter, P.: The Steiner Tree Problem. Annals of Discrete Mathematics\u00a053 (1992)"},{"issue":"4","key":"20_CR10","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/321906.321909","volume":"22","author":"O. Ibarra","year":"1975","unstructured":"Ibarra, O., Kim, C.: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems. Journal of the ACM\u00a022(4), 463\u2013468 (1975)","journal-title":"Journal of the ACM"},{"key":"20_CR11","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.: On the Terminal Steiner Problem. Information Processing Letters\u00a084, 103\u2013107 (2002)","journal-title":"Information Processing Letters"},{"key":"20_CR12","unstructured":"Robins, G., Zelikovsky, A.: Improved Steiner Tree Approximation in Graphs. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithm (SODA 2000), pp. 770\u2013779 (2000)"},{"key":"20_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1007\/978-3-540-24838-5_34","volume-title":"Experimental and Efficient Algorithms","author":"A.C. Santos Dos","year":"2004","unstructured":"Dos Santos, A.C., Lucena, A., Ribeiro, C.C.: Solving Diameter Constrained Minimum Spanning Tree Problems in Dense Graphs. In: Ribeiro, C.C., Martins, S.L. (eds.) WEA 2004. LNCS, vol.\u00a03059, pp. 458\u2013467. Springer, Heidelberg (2004)"},{"key":"20_CR14","first-page":"70","volume":"35","author":"S. Sahni","year":"1977","unstructured":"Sahni, S.: General Techniques for Combinatorial Approximations. Operations Research\u00a035, 70\u201379 (1977)","journal-title":"Operations Research"},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0167-6377(96)00021-1","volume":"19","author":"A. Tamir","year":"1996","unstructured":"Tamir, A.: An O(pn\n                2) Algorithm for the p-Median and Related Problems on Tree Graphs. Operations Research Letters\u00a019, 59\u201364 (1996)","journal-title":"Operations Research Letters"},{"issue":"1-2","key":"20_CR16","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/S0304-3975(98)00216-3","volume":"215","author":"L.S. Wang","year":"1999","unstructured":"Wang, L.S., Jia, X.H.: Note Fixed Topology Steiner Trees and Spanning Forests. Theoretical Computer Science\u00a0215(1-2), 359\u2013370 (1999)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"20_CR17","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s00453-004-1119-9","volume":"41","author":"G. Xue","year":"2004","unstructured":"Xue, G., Xiao, W.: A Polynomial Time Approximation Scheme for Minimum Cost Delay-Constrained Multicast Tree under a Steiner Topology. Algorithmica\u00a041(1), 53\u201372 (2004)","journal-title":"Algorithmica"},{"key":"20_CR18","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1109\/TNET.2007.900712","volume":"16","author":"G. Xue","year":"2008","unstructured":"Xue, G., Zhang, W., Tang, J., Thulasiraman, K.: Polynomial Time Approximation Algorithms for Multi-Constrained QoS Routing. IEEE\/ACM Transactions on Networking\u00a016, 656\u2013669 (2008)","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"5","key":"20_CR19","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/BF01187035","volume":"9","author":"A. Zelikovsky","year":"1993","unstructured":"Zelikovsky, A.: An \n                  \n                    \n                  \n                  $\\frac{11}{6}$\n                -Approximation Algorithm for the Network Steiner Problem. Algorithmica\u00a09(5), 463\u2013470 (1993)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17461-2_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T15:29:08Z","timestamp":1553268548000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17461-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642174605","9783642174612"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17461-2_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}