{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T16:12:25Z","timestamp":1769530345664,"version":"3.49.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2012,12,1]],"date-time":"2012-12-01T00:00:00Z","timestamp":1354320000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1007\/s00493-012-2760-6","type":"journal-article","created":{"date-parts":[[2013,1,3]],"date-time":"2013-01-03T09:12:31Z","timestamp":1357204351000},"page":"703-720","source":"Crossref","is-referenced-by-count":17,"title":["Degree bounded matroids and submodular flows"],"prefix":"10.1007","volume":"32","author":[{"given":"Tam\u00e1s","family":"Kir\u00e1ly","sequence":"first","affiliation":[]},{"given":"Lap Chi","family":"Lau","sequence":"additional","affiliation":[]},{"given":"Mohit","family":"Singh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,1,3]]},"reference":[{"key":"2760_CR1","doi-asserted-by":"crossref","unstructured":"N. Bansal, R. Khandekar, J. K\u00f6nemann, V. Nagarajan, B. Peis: On Generalizations of Network Design Problems with Degree Bounds, In Proceedings of the 14th Conference on Integer Programming and Combinatorial Optimization (IPCO) 110\u2013123, 2010.","DOI":"10.1007\/978-3-642-13036-6_9"},{"key":"2760_CR2","doi-asserted-by":"crossref","first-page":"1413","DOI":"10.1137\/080734340","volume":"39","author":"N. Bansal","year":"2009","unstructured":"N. Bansal, R. Khandekar and V. Nagarajan: Additive Guarantees for Degree Bounded Directed Network Design, SIAM Journal on Computing 39 (2009), 1413\u20131431.","journal-title":"SIAM Journal on Computing"},{"key":"2760_CR3","doi-asserted-by":"crossref","unstructured":"V. Bilo, V. Goyal, R. Ravi and M. Singh: On the Crossing Spanning Tree Problem, Proceedings of 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX) 51\u201360, 2004.","DOI":"10.1007\/978-3-540-27821-4_5"},{"key":"2760_CR4","unstructured":"K. Chaudhuri, S. Rao, S. Riesenfeld and K. Talwar: A Push-Relabel Algorithm for Approximating the Minimum-Degree MST Problem and its Generalization to Matroids, Theoretical Computer Science, 410, (2009), 4489\u20134503."},{"key":"2760_CR5","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0095-8956(84)90023-6","volume":"36","author":"W.H. Cunningham","year":"1984","unstructured":"W.H. Cunningham: Testing Membership in Matroid Polyhedra, Journal of Combinatorial Theory, Series B, 36, (1984), 161\u2013188.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"2760_CR6","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0167-5060(08)70734-9","volume":"1","author":"J. Edmonds","year":"1977","unstructured":"J. Edmonds, R. Giles: A Min-Max Relation for Submodular Functions on Graphs, Annals of Discrete Mathematics 1, (1977), 185\u2013204.","journal-title":"Annals of Discrete Mathematics"},{"key":"2760_CR7","first-page":"97","volume":"16","author":"A. Frank","year":"1982","unstructured":"A. Frank: An Algorithm for Submodular Functions on Graphs, Annals of Discrete Mathematics 16 (1982), 97\u2013120.","journal-title":"Annals of Discrete Mathematics"},{"key":"2760_CR8","unstructured":"A. Frieze: Personal Communication, March 2007."},{"key":"2760_CR9","doi-asserted-by":"crossref","unstructured":"M. X. Goemans: Minimum Bounded-Degree Spanning Trees, In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 273\u2013282, 2006.","DOI":"10.1109\/FOCS.2006.48"},{"key":"2760_CR10","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s004930170004","volume":"21","author":"K. Jain","year":"2001","unstructured":"K. Jain: A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem, Combinatorica 21 (2001), 39\u201360.","journal-title":"Combinatorica"},{"key":"2760_CR11","doi-asserted-by":"crossref","unstructured":"T. Kir\u00e1ly, L.C. Lau: Degree Bounded Forest Covering, In: Proceedings of the 15th International Conference on Integer Programming and Combinaotorial Optimization (IPCO), 315\u2013323, 2011.","DOI":"10.1007\/978-3-642-20807-2_25"},{"key":"2760_CR12","doi-asserted-by":"crossref","unstructured":"L.C. Lau, J. Naor, M. Salavatipour and M. Singh: Survivable Network Design with Degree or Order Constraints, In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC), 651\u2013660, 2007.","DOI":"10.1145\/1250790.1250886"},{"key":"2760_CR13","unstructured":"A. Schrijver: Combinatorial Optimization, Polyhedra and Efficiency, Springer-Verlag, 2003."},{"key":"2760_CR14","doi-asserted-by":"crossref","unstructured":"M. Singh and L.C. Lau: Approximating Minimum Bounded Degree Spanning Trees to within One of Optimal, In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC), 661\u2013670, 2007.","DOI":"10.1145\/1250790.1250887"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-012-2760-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-012-2760-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-012-2760-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,7]],"date-time":"2019-07-07T21:31:27Z","timestamp":1562535087000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-012-2760-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12]]},"references-count":14,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["2760"],"URL":"https:\/\/doi.org\/10.1007\/s00493-012-2760-6","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,12]]}}}