{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:55Z","timestamp":1725490255289},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642317699"},{"type":"electronic","value":"9783642317705"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31770-5_4","type":"book-chapter","created":{"date-parts":[[2012,7,26]],"date-time":"2012-07-26T05:03:12Z","timestamp":1343278992000},"page":"37-48","source":"Crossref","is-referenced-by-count":1,"title":["On the Minimum Diameter Cost-Constrained Steiner Tree Problem"],"prefix":"10.1007","author":[{"given":"Wei","family":"Ding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guoliang","family":"Xue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Apostolopoulos, G., Guerin, R., Kamat, S., Tripathi, S.: Quality of service based routing: a performance perspective. In: Proc. ACM SigComm 1998, pp. 17\u201328 (1998)","DOI":"10.1145\/285243.285251"},{"key":"4_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Application","author":"J.A. Bondy","year":"1976","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory with Application. Macmillan, London (1976)"},{"key":"4_CR3","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":"Y.H. 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.\u00a06784, pp. 141\u2013151. Springer, Heidelberg (2011)"},{"key":"4_CR4","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":"4_CR5","doi-asserted-by":"crossref","unstructured":"Ding, W.: Many-to-Many Multicast Routing Under a Fixed Topology: Basic Architecture, Problems and Algorithms. In: First International Conference on Networking and Distributed Computing (ICNDC 2010), pp. 128\u2013132 (2010)","DOI":"10.1109\/ICNDC.2010.34"},{"issue":"4","key":"4_CR6","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1142\/S179383091100136X","volume":"3","author":"W. Ding","year":"2011","unstructured":"Ding, W., Lin, G., Xue, G.: Diameter-Constrained Steiner Trees. Discrete Mathematics, Algorithms and Applications\u00a03(4), 491\u2013502 (2011)","journal-title":"Discrete Mathematics, Algorithms and Applications"},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/j.tcs.2009.08.003","volume":"412","author":"W. Ding","year":"2011","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.\u00a0412, 225\u2013232 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR8","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. Info. Proc. Lett.\u00a089, 15\u201318 (2004)","journal-title":"Info. Proc. Lett."},{"key":"4_CR9","doi-asserted-by":"publisher","DOI":"10.1142\/9789812791450","volume-title":"Steiner Tree Problems in Computer Communication Networks","author":"D. Du","year":"2008","unstructured":"Du, D., Hu, X.: Steiner Tree Problems in Computer Communication Networks. World Scientific Publishing Co. Pte. Ltd., Singapore (2008)"},{"key":"4_CR10","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. Info. Proc. Lett.\u00a087, 219\u2013220 (2003)","journal-title":"Info. Proc. Lett."},{"key":"4_CR11","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":"4_CR12","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1002\/net.10069","volume":"41","author":"L. Gouveia","year":"2003","unstructured":"Gouveia, L., Magnanti, T.L.: Network Flow Models for Designing Diameter-Constrained Minimum Spanning and Steiner Trees. Networks\u00a041, 159\u2013173 (2003)","journal-title":"Networks"},{"key":"4_CR13","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. Math. of Oper. Res.\u00a017, 36\u201342 (1992)","journal-title":"Math. of Oper. Res."},{"key":"4_CR14","series-title":"Annals of Disc. Math.","volume-title":"The Steiner Tree Problem","author":"F.K. Hwang","year":"1992","unstructured":"Hwang, F.K., Richards, D.S., Winter, P.: The Steiner Tree Problem. Annals of Disc. Math., vol.\u00a053. North-Holland, Amsterdam (1992)"},{"issue":"4","key":"4_CR15","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. J. ACM\u00a022(4), 463\u2013468 (1975)","journal-title":"J. ACM"},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/S0020-0190(02)00227-2","volume":"84","author":"G. Lin","year":"2002","unstructured":"Lin, G., Xue, G.: On the Terminal Steiner Problem. Info. Proc. Lett.\u00a084, 103\u2013107 (2002)","journal-title":"Info. Proc. Lett."},{"key":"4_CR17","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.tcs.2007.08.001","volume":"389","author":"F.V. Martineza","year":"2007","unstructured":"Martineza, F.V., Pinab, J.C.D., Soares, J.: Algorithm for Terminal Steiner Trees. Theor. Comput. Sci.\u00a0389, 133\u2013142 (2007)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"4_CR18","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1006\/jagm.1998.0930","volume":"28","author":"M.V. Marathe","year":"1998","unstructured":"Marathe, M.V., Ravi, R., Sundaram, R., Ravi, S.S., Rosenkrantz, D.J., Hunt III, H.B.: Bicriteria Network Design Problems. J. Algorithms\u00a028(1), 142\u2013171 (1998)","journal-title":"J. Algorithms"},{"key":"4_CR19","unstructured":"Robins, G., Zelikovsky, A.: Improved Steiner Tree Approximation in Graphs. In: Proc. of the 11th Annual ACM-SIAM Symposium on Discrete Algorithm (SODA 2000), pp. 770\u2013779 (2000)"},{"key":"4_CR20","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. dos Santos","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":"4_CR21","first-page":"70","volume":"35","author":"S. Sahni","year":"1977","unstructured":"Sahni, S.: General Techniques for Combinatorial Approximations. Oper. Res.\u00a035, 70\u201379 (1977)","journal-title":"Oper. Res."},{"key":"4_CR22","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. Oper. Res. Lett.\u00a019, 59\u201364 (1996)","journal-title":"Oper. Res. Lett."},{"key":"4_CR23","volume-title":"Approximation Algorithms","author":"V.V. Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Berlin (2001)"},{"issue":"1-2","key":"4_CR24","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1016\/S0304-3975(98)00216-3","volume":"215","author":"L. Wang","year":"1999","unstructured":"Wang, L., Jia, X.: Note Fixed Topology Steiner Trees and Spanning Forests. Theor. Comput. Sci.\u00a0215(1-2), 359\u2013370 (1999)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR25","doi-asserted-by":"publisher","first-page":"1228","DOI":"10.1109\/49.536364","volume":"14","author":"Z. Wang","year":"1996","unstructured":"Wang, Z., Crowcroft, J.: Quality-of-service routing for supporting multimedia applications. IEEE Journal on Selected Areas in Communications\u00a014, 1228\u20131234 (1996)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"issue":"1","key":"4_CR26","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":"4_CR27","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 Trans. Netw.\u00a016, 656\u2013669 (2008)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"5","key":"4_CR28","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-31770-5_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:47:51Z","timestamp":1620128871000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31770-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642317699","9783642317705"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31770-5_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}