{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T06:07:31Z","timestamp":1744265251176},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540407706"},{"type":"electronic","value":"9783540451983"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45198-3_10","type":"book-chapter","created":{"date-parts":[[2011,1,8]],"date-time":"2011-01-08T03:32:30Z","timestamp":1294457550000},"page":"109-121","source":"Crossref","is-referenced-by-count":2,"title":["Approximating the Degree-Bounded Minimum Diameter Spanning Tree Problem"],"prefix":"10.1007","author":[{"given":"Jochen","family":"K\u00f6nemann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Asaf","family":"Levin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amitabh","family":"Sinha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Bauer, F., Varma, A.: Degree-Constrained Multicasting in Point-to-Point Networks. In: Proc. of the 14th Annual Joint Conference of the IEEE Computer Communications Societies (INFOCOMM 1995), pp. 369\u2013376 (1995)","DOI":"10.1109\/INFCOM.1995.515897"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Chu, Y., Rao, S.G., Seshan, S., Zhang, H.: Enabling conferencing applications on the internet using an overlay multicast architecture. In: Proceedings of SIGCOMM, pp. 55\u201368 (2001)","DOI":"10.1145\/964723.383064"},{"issue":"2","key":"10_CR3","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1109\/90.222923","volume":"1","author":"W. Zhong De","year":"1993","unstructured":"De Zhong, W.: A copy network with shared buffers for large-scale multicast ATM switching. IEEE\/ACM Transactions on Networking\u00a01(2), 157\u2013165 (1993)","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"2","key":"10_CR4","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1145\/78952.78953","volume":"8","author":"S.E. Deering","year":"1990","unstructured":"Deering, S.E., Cheriton, D.R.: Multicast routing in datagram internetworks and extended LANs. ACM Transactions on Computer Systems\u00a08(2), 85 (1990)","journal-title":"ACM Transactions on Computer Systems"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Deering, S., Estrin, D., Farinacci, D.: An architecture for wide-area multicast routing. In: Proceedings of SIGCOMM (1994)","DOI":"10.1145\/190314.190326"},{"key":"10_CR6","unstructured":"F\u00fcrer, M., Raghavachari, B.: An NC approximation algorithm for the minimum degree spanning tree problem. In: Proc. of the 28th Annual Allerton Conference on Communication, Control and Computing, pp. 274\u2013281 (1990)"},{"key":"10_CR7","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, New York (1979)"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/0377-2217(95)00090-9","volume":"95","author":"L. Gouveia","year":"1996","unstructured":"Gouveia, L.: Multicommodity flow models for spanning trees with hop constraints. European Journal of Operational Research\u00a095, 178\u2013190 (1996)","journal-title":"European Journal of Operational Research"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0020-0190(94)00183-Y","volume":"53","author":"R. Hassin","year":"1995","unstructured":"Hassin, R., Tamir, A.: On the minimum diameter spanning tree problem. Information Processing Letters\u00a053, 109\u2013111 (1995)","journal-title":"Information Processing Letters"},{"issue":"6","key":"10_CR10","doi-asserted-by":"publisher","first-page":"1783","DOI":"10.1137\/S009753970036917X","volume":"31","author":"J. K\u00f6nemann","year":"2002","unstructured":"K\u00f6nemann, J., Ravi, R.: A matter of degree: Improved approximation algorithms for degree-bounded minimum spanning trees. SIAM Journal of Computing\u00a031(6), 1783\u20131793 (2002)","journal-title":"SIAM Journal of Computing"},{"key":"10_CR11","unstructured":"K\u00f6nemann, J., Ravi, R.: Primal-dual algorithms come of age: Approximating MST\u2019s with nonuniform degree bounds. In: To appear in Proc. of the 35th ACM Symposium on Theory of Computing (2003)"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Ravi, R.: Rapid rumor ramification: Approximating the minimum broadcast time. In: Proc. of the 35th Annual IEEE Symposium on Foundations of Computer Science, pp. 202\u2013213 (1994)","DOI":"10.1109\/SFCS.1994.365693"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1023\/A:1018967121276","volume":"86","author":"S. Voss","year":"1999","unstructured":"Voss, S.: The Steiner tree problem with hop constraints. Annals of Operations Research\u00a086, 321\u2013345 (1999)","journal-title":"Annals of Operations Research"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45198-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T18:05:15Z","timestamp":1559930715000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45198-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407706","9783540451983"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45198-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}