{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:29:11Z","timestamp":1725560951770},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540206804"},{"type":"electronic","value":"9783540245971"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24597-1_25","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T03:39:20Z","timestamp":1280374760000},"page":"289-301","source":"Crossref","is-referenced-by-count":5,"title":["Quasi-polynomial Time Approximation Algorithm for Low-Degree Minimum-Cost Steiner Trees"],"prefix":"10.1007","author":[{"given":"Jochen","family":"K\u00f6nemann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Ravi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_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 Journal on Computing\u00a024, 440\u2013456 (1995)","journal-title":"SIAM Journal on Computing"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1006\/jagm.1994.1042","volume":"17","author":"M. F\u00fcrer","year":"1994","unstructured":"F\u00fcrer, M., Raghavachari, B.: Approximating the minimum degree Steiner tree to within one of optimal. Journal of Algorithms\u00a017, 409\u2013423 (1994)","journal-title":"Journal of Algorithms"},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/S0097539793242618","volume":"24","author":"M.X. Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: A general approximation technique for constrained forest problems. SIAM J. Computing\u00a024, 296\u2013317 (1995)","journal-title":"SIAM J. Computing"},{"key":"#cr-split#-25_CR4.1","doi-asserted-by":"crossref","unstructured":"K\u00f6nemann, J., Ravi, R.: A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees. In: Proceedings of the 32nd Symp. on the Theory of Comput., pp. 537-546 (2000)","DOI":"10.1145\/335305.335371"},{"key":"#cr-split#-25_CR4.2","doi-asserted-by":"crossref","unstructured":"A complete version appears in the SIAM J. on Comput., 31(6), 1783-1793 (2002)","DOI":"10.1137\/S009753970036917X"},{"key":"25_CR5","unstructured":"K\u00f6nemann, J., Ravi, R.: Primal-dual algorithms come of age: Approximating MST\u2019s with nonuniform degree bounds. In: Proceedings, ACM Symposium on Theory of Computing (2003)"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Ravi, R., Marathe, M.V., Ravi, S.S., Rosenkrantz, D.J., Hunt III, H.B.: Many Birds with One Stone: Multi-Objective Approximation Algorithms (Extended Abstract). In: Proceedings of the 25th Symp. on the Theory of Comput., pp. 438\u2013447 (1993)","DOI":"10.1145\/167088.167209"},{"issue":"1","key":"25_CR7","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/s00453-001-0038-2","volume":"31","author":"R. Ravi","year":"2001","unstructured":"Ravi, R., Marathe, M.V., Ravi, S.S., Rosenkrantz, D.J., Hunt III, H.B.: Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems. Algorithmica\u00a031(1), 58\u201378 (2001)","journal-title":"Algorithmica"},{"key":"25_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/3-540-56287-7_112","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"R. Ravi","year":"1992","unstructured":"Ravi, R., Raghavachari, B., Klein, P.N.: Approximation through local optimality: Designing networks with small degree. In: Shyamasundar, R.K. (ed.) FSTTCS 1992. LNCS, vol.\u00a0652, pp. 279\u2013290. Springer, Heidelberg (1992)"}],"container-title":["Lecture Notes in Computer Science","FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24597-1_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T16:46:20Z","timestamp":1558284380000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24597-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540206804","9783540245971"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24597-1_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}