{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T10:13:56Z","timestamp":1781345636675,"version":"3.54.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2020,6,15]],"date-time":"2020-06-15T00:00:00Z","timestamp":1592179200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,15]],"date-time":"2020-06-15T00:00:00Z","timestamp":1592179200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["327620-09"],"award-info":[{"award-number":["327620-09"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["Discovery Accelerator Supplement"],"award-info":[{"award-number":["Discovery Accelerator Supplement"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003246","name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["016.Vidi.189.087"],"award-info":[{"award-number":["016.Vidi.189.087"]}],"id":[{"id":"10.13039\/501100003246","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001711","name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","doi-asserted-by":"publisher","award":["200021_165866"],"award-info":[{"award-number":["200021_165866"]}],"id":[{"id":"10.13039\/501100001711","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001711","name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","doi-asserted-by":"publisher","award":["200021_184622"],"award-info":[{"award-number":["200021_184622"]}],"id":[{"id":"10.13039\/501100001711","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s10107-020-01524-y","type":"journal-article","created":{"date-parts":[[2020,6,17]],"date-time":"2020-06-17T18:04:11Z","timestamp":1592417051000},"page":"397-418","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Approximate multi-matroid intersection via iterative refinement"],"prefix":"10.1007","volume":"183","author":[{"given":"Andr\u00e9","family":"Linhares","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Neil","family":"Olver","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1108-7941","authenticated-orcid":false,"given":"Chaitanya","family":"Swamy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rico","family":"Zenklusen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,6,15]]},"reference":[{"issue":"11","key":"1524_CR1","doi-asserted-by":"publisher","first-page":"4895","DOI":"10.1090\/S0002-9947-06-03833-5","volume":"358","author":"R Aharoni","year":"2006","unstructured":"Aharoni, R., Berger, E.: The intersection of a matroid and a simplicial complex. Trans. Am. Math. Soc. 358(11), 4895\u20134917 (2006)","journal-title":"Trans. Am. Math. Soc."},{"issue":"1\u20132","key":"1524_CR2","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s10107-012-0537-8","volume":"141","author":"N Bansal","year":"2013","unstructured":"Bansal, N., Khandekar, R., K\u00f6nemann, J., Nagarajan, V., Peis, B.: On generalizations of network design problems with degree bounds. Math. Program. 141(1\u20132), 479\u2013506 (2013)","journal-title":"Math. Program."},{"issue":"4","key":"1524_CR3","doi-asserted-by":"publisher","first-page":"1413","DOI":"10.1137\/080734340","volume":"39","author":"N Bansal","year":"2009","unstructured":"Bansal, N., Khandekar, R., Nagarajan, V.: Additive guarantees for degree-bounded directed network design. SIAM J. Comput. 39(4), 1413\u20131431 (2009)","journal-title":"SIAM J. Comput."},{"key":"1524_CR4","doi-asserted-by":"crossref","unstructured":"Chakrabarty, D., Swamy, C.: Approximation algorithms for minimum norm and ordered optimization problems. In: Proceedings of the 51st Annual ACM Symposium on Theory of Computing (STOC), pp. 126\u2013137 (2019)","DOI":"10.1145\/3313276.3316322"},{"key":"1524_CR5","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10107-011-0451-5","volume":"135","author":"YH Chan","year":"2012","unstructured":"Chan, Y.H., Lau, L.C.: On linear and semidefinite programming relaxations for hypergraphic matching. Math. Program. 135, 123\u2013148 (2012)","journal-title":"Math. Program."},{"key":"1524_CR6","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Vondr\u00e1k, J., Zenklusen, R.: Multi-budgeted matchings and matroid intersection via dependent rounding. In: Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1080\u20131097 (2011)","DOI":"10.1137\/1.9781611973082.82"},{"issue":"6","key":"1524_CR7","doi-asserted-by":"publisher","first-page":"1831","DOI":"10.1137\/110839655","volume":"43","author":"C Chekuri","year":"2014","unstructured":"Chekuri, C., Vondr\u00e1k, J., Zenklusen, R.: Submodular function maximization via the multilinear relaxation and contention resolution schemes. SIAM J. Comput. 43(6), 1831\u20131879 (2014)","journal-title":"SIAM J. Comput."},{"key":"1524_CR8","volume-title":"Combinatoral Optimization","author":"WJ Cook","year":"1998","unstructured":"Cook, W.J., Cunningham, W.H., Pulleyblank, W.R., Schrijver, A.: Combinatoral Optimization. Wiley-Interscience, John Wiley and Sons Inc (1998)"},{"key":"1524_CR9","doi-asserted-by":"crossref","unstructured":"Cygan, M.: Improved approximation for $$3$$-dimensional matching via bounded pathwidth local search. In: Proceedings of 54th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 509\u2013518 (2013)","DOI":"10.1109\/FOCS.2013.61"},{"key":"1524_CR10","doi-asserted-by":"crossref","unstructured":"Cygan, M., Grandoni, F., Mastrolilli, M. (2013). How to sell hyperedges: the hypermatching assignment problem. In: Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 342\u2013351","DOI":"10.1137\/1.9781611973105.25"},{"key":"1524_CR11","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BFb0121195","volume":"8","author":"ML Fisher","year":"1978","unstructured":"Fisher, M.L., Nemhauser, G.L., Wolsey, L.A.: An analysis of approximations for maximizing submodular set functions\u2014II. Math. Program. Study 8, 73\u201387 (1978)","journal-title":"Math. Program. Study"},{"issue":"2","key":"1524_CR12","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/BF02579271","volume":"1","author":"Z F\u00fcredi","year":"1981","unstructured":"F\u00fcredi, Z.: Maximum degree and fractional matchings in uniform hypergraphs. Combinatorica 1(2), 155\u2013162 (1981)","journal-title":"Combinatorica"},{"issue":"1\u20132","key":"1524_CR13","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1007\/s10107-013-0703-7","volume":"146","author":"F Grandoni","year":"2014","unstructured":"Grandoni, F., Ravi, R., Singh, M., Zenklusen, R.: New approaches to multi-objective optimization. Math. Program. 146(1\u20132), 525\u2013554 (2014)","journal-title":"Math. Program."},{"key":"1524_CR14","doi-asserted-by":"crossref","unstructured":"Gupta, A., Roth, A., Schoenebeck, G., Talwar, K.: Constrained non-monotone submodular maximization: offline and secretary algorithms. In: Proceedings of the 6th International Conference on Internet and Network Economics (WINE), pp.s 246\u2013257 (2010)","DOI":"10.1007\/978-3-642-17572-5_20"},{"key":"1524_CR15","unstructured":"Halld\u00f3rsson, M.M.: Approximating discrete collections via local improvements. In: Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 160\u2013169 (1995)"},{"issue":"1","key":"1524_CR16","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1137\/0402008","volume":"2","author":"CAJ Hurkens","year":"1989","unstructured":"Hurkens, C.A.J., Schrijver, A.: On the size of systems of sets every $$t$$ of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems. SIAM J. Discrete Math. 2(1), 68\u201372 (1989)","journal-title":"SIAM J. Discrete Math."},{"issue":"6","key":"1524_CR17","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1007\/s00493-012-2760-6","volume":"32","author":"T Kir\u00e1ly","year":"2012","unstructured":"Kir\u00e1ly, T., Lau, L.C., Singh, M.: Degree bounded matroids and submodular flows. Combinatorica 32(6), 703\u2013720 (2012)","journal-title":"Combinatorica"},{"key":"1524_CR18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511977152","volume-title":"Iterative Methods in Combinatorial Optimization","author":"LC Lau","year":"2011","unstructured":"Lau, L.C., Ravi, R., Singh, M.: Iterative Methods in Combinatorial Optimization, 1st edn. Cambridge University Press, New York (2011)","edition":"1"},{"issue":"4","key":"1524_CR19","doi-asserted-by":"publisher","first-page":"2053","DOI":"10.1137\/090750020","volume":"23","author":"J Lee","year":"2010","unstructured":"Lee, J., Mirrokni, V., Nagarajan, V., Sviridenko, M.: Maximizing nonmonotone submodular functions under matroid or knapsack constraints. SIAM J. Discrete Math. 23(4), 2053\u20132078 (2010)","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"1524_CR20","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1287\/moor.1100.0463","volume":"35","author":"J Lee","year":"2010","unstructured":"Lee, J., Sviridenko, M., Vondr\u00e1k, J.: Submodular maximization over multiple matroids via generalized exchange properties. Math. Oper. Res. 35(4), 795\u2013806 (2010)","journal-title":"Math. Oper. Res."},{"key":"1524_CR21","doi-asserted-by":"crossref","unstructured":"Linhares, A., Olver, N., Swamy, C., Zenklusen, R.: Approximate multi-matroid intersection via iterative refinement. In: Proceedings of Integer Programming and Combinatorial Optimization (IPCO), pp. 299\u2013312 (2019)","DOI":"10.1007\/978-3-030-17953-3_23"},{"key":"1524_CR22","doi-asserted-by":"crossref","unstructured":"Parekh, O., Pritchard, D.: Generalized hypergraph matching via iterated packing and local ratio. In: Proceedings of Workshop on Approximation and Online Algorithms (WAOA 2014), pp. 207\u2013223. Springer (2015)","DOI":"10.1007\/978-3-319-18263-6_18"},{"key":"1524_CR23","volume-title":"Combinatorial Optimization, Polyhedra and Efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization, Polyhedra and Efficiency. Springer, New York (2003)"},{"issue":"1","key":"1524_CR24","doi-asserted-by":"publisher","first-page":"1:1","DOI":"10.1145\/2629366","volume":"62","author":"M Singh","year":"2015","unstructured":"Singh, M., Lau, L.C.: Approximating minimum bounded degree spanning trees to within one of optimal. J. ACM 62(1), 1:1\u20131:19 (2015)","journal-title":"J. ACM"},{"key":"1524_CR25","doi-asserted-by":"crossref","unstructured":"Zenklusen, R.: Matroidal degree-bounded minimum spanning trees. In: Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1512\u20131521 (2012)","DOI":"10.1137\/1.9781611973099.120"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-020-01524-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-020-01524-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-020-01524-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,14]],"date-time":"2021-06-14T23:07:08Z","timestamp":1623712028000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-020-01524-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,15]]},"references-count":25,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["1524"],"URL":"https:\/\/doi.org\/10.1007\/s10107-020-01524-y","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6,15]]},"assertion":[{"value":"1 June 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 May 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 June 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}