{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:30:06Z","timestamp":1725514206084},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540688860"},{"type":"electronic","value":"9783540688914"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68891-4_18","type":"book-chapter","created":{"date-parts":[[2008,5,23]],"date-time":"2008-05-23T13:31:37Z","timestamp":1211549497000},"page":"259-272","source":"Crossref","is-referenced-by-count":11,"title":["Degree Bounded Matroids and Submodular Flows"],"prefix":"10.1007","author":[{"given":"Tam\u00e1s","family":"Kir\u00e1ly","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lap Chi","family":"Lau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohit","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Bansal, N., Khandekar, R., Nagarajan, V.: Additive Guarantees for Degree Bounded Directed Network Design, IBM Research Report RC24347 (September 2007)","DOI":"10.1145\/1374376.1374486"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/978-3-540-27821-4_5","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"V. Bilo","year":"2004","unstructured":"Bilo, V., Goyal, V., Ravi, R., Singh, M.: On the Crossing Spanning Tree Problem. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol.\u00a03122, pp. 51\u201360. Springer, Heidelberg (2004)"},{"key":"18_CR3","unstructured":"Chaudhuri, K., Rao, S., Riesenfeld, S., Talwar, K.: A Push-Relabel Algorithm for Approximating the Minimum-Degree MST Problem and its Generalization to Matroids, Invited submission to Theoretical Computer Science (Special Issue for ICALP 2006) (2006)"},{"issue":"2","key":"18_CR4","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0095-8956(84)90023-6","volume":"36","author":"W.H. Cunningham","year":"1984","unstructured":"Cunningham, W.H.: Testing membership in matroid polyhedra. Journal of Combinatorial Theory, Series B\u00a036(2), 161\u2013188 (1984)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0167-5060(08)70734-9","volume":"1","author":"J. Edmonds","year":"1977","unstructured":"Edmonds, J., Giles, R.: A min-max relation for submodular functions on graphs. Ann. Discrete Math.\u00a01, 185\u2013204 (1977)","journal-title":"Ann. Discrete Math."},{"key":"18_CR6","first-page":"97","volume":"16","author":"A. Frank","year":"1982","unstructured":"Frank, A.: An algorithm for submodular functions on graphs. Ann. Discrete Math.\u00a016, 97\u2013120 (1982)","journal-title":"Ann. Discrete Math."},{"key":"18_CR7","unstructured":"Frieze, A.: Personal Communication (March 2007)"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Goemans, M.X.: Minimum bounded-degree spanning trees. In: Proceedings of 47th IEEE FOCS, pp. 273\u2013282 (2006)","DOI":"10.1109\/FOCS.2006.48"},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s004930170004","volume":"21","author":"K. Jain","year":"2001","unstructured":"Jain, K.: A factor 2 approxiamtion algorithm for the generalized Steiner network problem. Combinatorica\u00a021, 39\u201360 (2001)","journal-title":"Combinatorica"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Lau, L.C., Naor, J., Salavatipour, M., Singh, M.: Survivable network design with degree or order constraints. In: Proceedings of 39th ACM STOC, pp. 651\u2013660 (2007)","DOI":"10.1145\/1250790.1250886"},{"key":"18_CR11","volume-title":"Combinatorial Optimization, Polyhedra and Efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization, Polyhedra and Efficiency. Springer, Heidelberg (2003)"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Singh, M., Lau, L.C.: Approximating minimum bounded degree spanning trees to within one of optimal. In: Proceedings of the 39th ACM STOC, pp. 661\u2013670 (2007)","DOI":"10.1145\/1250790.1250887"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68891-4_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:17:48Z","timestamp":1620015468000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68891-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540688860","9783540688914"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68891-4_18","relation":{},"subject":[]}}