{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:08:19Z","timestamp":1725566899454},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540282396"},{"type":"electronic","value":"9783540318743"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11538462_3","type":"book-chapter","created":{"date-parts":[[2010,9,28]],"date-time":"2010-09-28T04:13:22Z","timestamp":1285647202000},"page":"26-39","source":"Crossref","is-referenced-by-count":14,"title":["What Would Edmonds Do? Augmenting Paths and Witnesses for 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":"3_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":"3_CR2","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":"3_CR3","doi-asserted-by":"publisher","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, trees, and flowers. Canadian Journal of Mathematics\u00a017, 449\u2013467 (1965)","journal-title":"Canadian Journal of Mathematics"},{"issue":"4","key":"3_CR4","first-page":"507","volume":"4","author":"S. Even","year":"1975","unstructured":"Even, S., Tarjan, R.E.: Network flow and testing graph connectivity. SIAM. Journal on Computing\u00a04(4), 507\u2013518 (1975)","journal-title":"Journal on Computing"},{"key":"3_CR5","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":"3_CR6","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":"3_CR7","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J. Hopcroft","year":"1973","unstructured":"Hopcroft, J., Karp, R.: An n 5\/2 algorithm for maximum matching in bipartite graphs. SIAM Journal on Computing\u00a02, 225\u2013231 (1973)","journal-title":"SIAM Journal on Computing"},{"key":"3_CR8","unstructured":"Jothi, R., Raghavachari, B.: Degree-bounded minimum spanning trees. In: Proc. 16th Canadian Conf. on Computational Geometry (CCCG) (2004)"},{"issue":"2","key":"3_CR9","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."},{"key":"3_CR10","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 ACM STOC (2000)","DOI":"10.1145\/335305.335371"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"K\u00f6nemann, J., Ravi, R.: Primal-dual meets local search: approximating MST\u2019s with nonuniform degree bounds. In: ACM (ed.) Proceedings ACM STOC (2003)","DOI":"10.1145\/780596.780600"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/3-540-45294-X_20","volume-title":"FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science","author":"R. Krishnan","year":"2001","unstructured":"Krishnan, R., Raghavachari, B.: The directed minimum degree spanning tree problem. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) FSTTCS 2001. LNCS, vol.\u00a02245, pp. 232\u2013243. Springer, Heidelberg (2001)"},{"key":"3_CR13","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":"3_CR14","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. In: Proceedings of ACM STOC (1993)","DOI":"10.1145\/167088.167209"},{"key":"3_CR15","doi-asserted-by":"crossref","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 (2001)","DOI":"10.1007\/s00453-001-0038-2"}],"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\/11538462_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,10]],"date-time":"2021-11-10T19:10:10Z","timestamp":1636571410000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11538462_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540282396","9783540318743"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11538462_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}