{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T02:05:18Z","timestamp":1768788318349,"version":"3.49.0"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,11,10]],"date-time":"2007-11-10T00:00:00Z","timestamp":1194652800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2009,9]]},"DOI":"10.1007\/s00453-007-9115-5","type":"journal-article","created":{"date-parts":[[2007,11,9]],"date-time":"2007-11-09T15:22:08Z","timestamp":1194621728000},"page":"157-189","source":"Crossref","is-referenced-by-count":18,"title":["What Would Edmonds Do? Augmenting Paths and\u00a0Witnesses for Degree-Bounded MSTs"],"prefix":"10.1007","volume":"55","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","published-online":{"date-parts":[[2007,11,10]]},"reference":[{"key":"9115_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":"9115_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/11538462_3","volume-title":"APPROX-RANDOM","author":"K. Chaudhuri","year":"2005","unstructured":"Chaudhuri, K., Rao, S., Riesenfeld, S., Talwar, K.: What would Edmonds do? Augmenting paths and witnesses for degree-bounded msts. In: Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) APPROX-RANDOM. Lecture Notes in Computer Science, vol. 3624, pp. 26\u201339. Springer, New York (2005)"},{"key":"9115_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/11786986_18","volume-title":"ICALP (1)","author":"K. Chaudhuri","year":"2006","unstructured":"Chaudhuri, K., Rao, S., Riesenfeld, S., Talwar, K.: A push-relabel algorithm for approximating degree bounded MSTs. In: ICALP (1). Lecture Notes in Computer Science, vol. 4051, pp. 191\u2013201. Springer, New York (2006)"},{"key":"9115_CR4","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. J. Res. Nat. Bur. Stand. 69B, 125\u2013130 (1965)","journal-title":"J. Res. Nat. Bur. Stand."},{"key":"9115_CR5","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"Edmonds, J.: Paths, trees, and flowers. Can. J. Math. 17, 449\u2013467 (1965)","journal-title":"Can. J. Math."},{"issue":"3","key":"9115_CR6","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/(SICI)1097-0118(200003)33:3<125::AID-JGT1>3.0.CO;2-X","volume":"33","author":"M. Ellingham","year":"2000","unstructured":"Ellingham, M., Zha, X.: Toughness, trees and walks. J. Graph Theory 33(3), 125\u2013137 (2000)","journal-title":"J. Graph Theory"},{"issue":"4","key":"9115_CR7","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1137\/0204043","volume":"4","author":"S. Even","year":"1975","unstructured":"Even, S., Tarjan, R.E.: Network flow and testing graph connectivity. SIAM J. Comput. 4(4), 507\u2013518 (1975)","journal-title":"SIAM J. Comput."},{"key":"9115_CR8","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":"9115_CR9","doi-asserted-by":"crossref","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. J. Algorithms 17(3), 409\u2013423 (1994)","journal-title":"J. Algorithms"},{"key":"9115_CR10","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1002\/net.3230120402","volume":"12","author":"B. Gavish","year":"1982","unstructured":"Gavish, B.: Topological design of centralized computer networks\u2013formulations and algorithms. Networks 12, 355\u2013377 (1982)","journal-title":"Networks"},{"key":"9115_CR11","first-page":"273","volume-title":"FOCS","author":"M.X. Goemans","year":"2006","unstructured":"Goemans, M.X.: Minimum bounded degree spanning trees. In: FOCS, pp. 273\u2013282. IEEE Computer Society, New York (2006)"},{"key":"9115_CR12","doi-asserted-by":"crossref","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\u2019 heuristic: some paths are more difficult than cycles. Oper. Res. Lett. 10, 291\u2013295 (1991)","journal-title":"Oper. Res. Lett."},{"key":"9115_CR13","doi-asserted-by":"crossref","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 J. Comput. 2, 225\u2013231 (1973)","journal-title":"SIAM J. Comput."},{"key":"9115_CR14","unstructured":"Jothi, R., Raghavachari, B.: Degree-bounded minimum spanning trees. In: Proc. 16th Canadian Conf. on Computational Geometry (CCCG), 2004"},{"issue":"2","key":"9115_CR15","doi-asserted-by":"crossref","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. 25(2), 355\u2013368 (1996)","journal-title":"SIAM J. Comput."},{"key":"9115_CR16","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1145\/335305.335371","volume-title":"Proceedings of the Thirty Second Annual ACM Symposium on Theory of Computing","author":"J. K\u00f6nemann","year":"2000","unstructured":"K\u00f6nemann, J., Ravi, R.: A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees. In: Proceedings of the Thirty Second Annual ACM Symposium on Theory of Computing: Portland, Oregon, May 21\u201323, 2000, pp. 537\u2013546. ACM Press, New York (2000)"},{"key":"9115_CR17","first-page":"389","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":"9115_CR18","doi-asserted-by":"crossref","unstructured":"Krishnan, R., Raghavachari, B.: The directed minimum degree spanning tree problem. In: FSTTCS, pp. 232\u2013243 (2001)","DOI":"10.1007\/3-540-45294-X_20"},{"key":"9115_CR19","doi-asserted-by":"crossref","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 5, 231\u2013246 (1984)","journal-title":"J. Algorithms"},{"key":"9115_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/11786986_16","volume-title":"ICALP (1)","author":"R. Ravi","year":"2006","unstructured":"Ravi, R., Singh, M.: Delegate and conquer: an LP-based approximation algorithm for minimum degree MSTs. In: ICALP (1). Lecture Notes in Computer Science, vol. 4051, pp. 169\u2013180. Springer, New York (2006)"},{"key":"9115_CR21","first-page":"438","volume-title":"Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing","author":"R. Ravi","year":"1993","unstructured":"Ravi, R., Marathe, M.V., Ravi, S.S., Rosenkrantz, D.J., Hunt, H.B.\u00a0III: Many birds with one stone: multi-objective approximation algorithms. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, pp. 438\u2013447. ACM Press, New York (1993)"},{"key":"9115_CR22","doi-asserted-by":"crossref","unstructured":"Ravi, R., Marathe, M.V., Ravi, S.S., Rosenkrantz, D.J., Hunt, H.B.\u00a0III: Approximation algorithms for degree-constrained minimum-cost network-design problems. Algorithmica 31 (2001)","DOI":"10.1007\/s00453-001-0038-2"},{"key":"9115_CR23","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1145\/1250790.1250887","volume-title":"STOC \u201907: Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing","author":"M. Singh","year":"2007","unstructured":"Singh, M., Lau, L.C.: Approximating minimum bounded degree spanning trees to within one of optimal. In: STOC \u201907: Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing, pp. 661\u2013670. ACM Press, New York (2007)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9115-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-007-9115-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-007-9115-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,27]],"date-time":"2021-08-27T06:34:52Z","timestamp":1630046092000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-007-9115-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11,10]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,9]]}},"alternative-id":["9115"],"URL":"https:\/\/doi.org\/10.1007\/s00453-007-9115-5","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,11,10]]}}}