{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:47:09Z","timestamp":1725472029751},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540359043"},{"type":"electronic","value":"9783540359050"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"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":[[2006]]},"DOI":"10.1007\/11786986_18","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T10:46:45Z","timestamp":1151491605000},"page":"191-201","source":"Crossref","is-referenced-by-count":14,"title":["A Push-Relabel Algorithm for Approximating Degree Bounded MSTs"],"prefix":"10.1007","author":[{"given":"Kamalika","family":"Chaudhuri","sequence":"first","affiliation":[]},{"given":"Satish","family":"Rao","sequence":"additional","affiliation":[]},{"given":"Samantha","family":"Riesenfeld","sequence":"additional","affiliation":[]},{"given":"Kunal","family":"Talwar","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/777792.777795","volume-title":"Proceedings of the nineteenth annual symposium on Computational geometry","author":"T.M. Chan","year":"2003","unstructured":"Chan, T.M.: Euclidean bounded-degree spanning tree ratios. In: Proceedings of the nineteenth annual symposium on Computational geometry, pp. 11\u201319. ACM Press, New York (2003)"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Chaudhuri, K., Rao, S., Riesenfeld, S., Talwar, K.: What would edmonds do? augmenting paths and witnesses for bounded degree msts. In: Proceedings of APPROX\/RANDOM (2005)","DOI":"10.1007\/11538462_3"},{"key":"18_CR3","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69B","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Maximum matching and a polyhedron with 0\u20131 vertices. Journal of Research National Bureau of Standards\u00a069B, 125\u2013130 (1965)","journal-title":"Journal of Research National Bureau of Standards"},{"key":"18_CR4","unstructured":"Fischer, T.: Optimizing the degree of minimum weight spanning trees. Technical Report 14853, Dept of Computer Science, Cornell University, Ithaca, NY (1993)"},{"issue":"3","key":"18_CR5","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(3), 409\u2013423 (1994)","journal-title":"Journal of Algorithms"},{"key":"18_CR6","unstructured":"Goemans, M.: Personal communication (2006)"},{"key":"18_CR7","unstructured":"Golberg, A.V.: A new max-flow algorithm. Technical Report MIT\/LCS\/TM-291, Massachussets Institute of Technology, Technical Report (1985)"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1145\/12130.12144","volume-title":"Proceedings of the eighteenth annual ACM symposium on Theory of computing","author":"A.V. Goldberg","year":"1986","unstructured":"Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum flow problem. In: Proceedings of the eighteenth annual ACM symposium on Theory of computing, pp. 136\u2013146. ACM Press, New York (1986)"},{"issue":"4","key":"18_CR9","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"A.V. Goldberg","year":"1988","unstructured":"Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum-flow problem. J. ACM\u00a035(4), 921\u2013940 (1988)","journal-title":"J. ACM"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0167-6377(91)90016-I","volume":"10","author":"J.A. Hoogeveen","year":"1991","unstructured":"Hoogeveen, J.A.: Analysis of christofides heuristic: Some paths are more difficult than cycles. Operation Research Letters\u00a010, 291\u2013295 (1991)","journal-title":"Operation Research Letters"},{"key":"18_CR11","unstructured":"Jothi, R., Raghavachari, B.: Degree-bounded minimum spanning trees. In: Proc. 16th Canadian Conf. on Computational Geometry (CCCG) (2004)"},{"issue":"2","key":"18_CR12","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1137\/S0097539794264585","volume":"25","author":"S. Khuller","year":"1996","unstructured":"Khuller, S., Raghavachari, B., Young, N.: Low-degree spanning trees of small weight. SIAM J. Comput.\u00a025(2), 355\u2013368 (1996)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"18_CR13","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 on Computing\u00a031(6), 1783\u20131793 (2002)","journal-title":"SIAM Journal on Computing"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1145\/780542.780600","volume-title":"Proceedings of the Thirty-Fifth ACM Symposium on Theory of Computing","author":"J. K\u00f6nemann","year":"2003","unstructured":"K\u00f6nemann, J., Ravi, R.: Primal-dual meets local search: approximating MST\u2019s with nonuniform degree bounds. In: Proceedings of the Thirty-Fifth ACM Symposium on Theory of Computing, San Diego, CA, USA, June 9\u201311, 2003, pp. 389\u2013395. ACM Press, New York (2003)"},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0196-6774(84)90029-4","volume":"5","author":"C.H. Papadimitriou","year":"1984","unstructured":"Papadimitriou, C.H., Vazirani, U.: On two geometric problems related to the traveling salesman problem. J. Algorithms\u00a05, 231\u2013246 (1984)","journal-title":"J. Algorithms"},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Languages and Programming","author":"R. Ravi","year":"2006","unstructured":"Ravi, R., Singh, M.: Delegate and conquer: An LP-based approximation algorithm for minimum degree msts. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11786986_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,28]],"date-time":"2021-07-28T23:26:29Z","timestamp":1627514789000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11786986_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540359043","9783540359050"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11786986_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}