{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:57:21Z","timestamp":1781305041378,"version":"3.54.1"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032286901","type":"print"},{"value":"9783032286918","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-28691-8_25","type":"book-chapter","created":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:33:14Z","timestamp":1781303594000},"page":"378-393","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Weighted-to-Unweighted Reduction for\u00a0Matroid Intersection"],"prefix":"10.1007","author":[{"given":"Aditi","family":"Dudeja","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-7778-0627","authenticated-orcid":false,"given":"Mara","family":"Grilnberger","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,13]]},"reference":[{"issue":"1","key":"25_CR1","doi-asserted-by":"publisher","first-page":"231","DOI":"10.2307\/1995784","volume":"158","author":"M Aigner","year":"1971","unstructured":"Aigner, M., Dowling, T.A.: Matching theory for combinatorial geometries. Trans. Am. Math. Soc. 158(1), 231\u2013245 (1971). https:\/\/doi.org\/10.2307\/1995784","journal-title":"Trans. Am. Math. Soc."},{"key":"25_CR2","doi-asserted-by":"publisher","unstructured":"Assadi, S., Behnezhad, S.: On the robust communication complexity of bipartite matching. Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM, (2021). https:\/\/doi.org\/10.4230\/LIPIcs.APPROX\/RANDOM.2021.48","DOI":"10.4230\/LIPIcs.APPROX\/RANDOM.2021.48"},{"key":"25_CR3","doi-asserted-by":"publisher","unstructured":"Assadi, S., Bernstein, A.: Towards a unified theory of sparsification for matching problems. In: 2nd Symposium on Simplicity in Algorithms (SOSA), pp. 11:1\u201311:20 (2019). https:\/\/doi.org\/10.4230\/OASIcs.SOSA.2019.11","DOI":"10.4230\/OASIcs.SOSA.2019.11"},{"key":"25_CR4","doi-asserted-by":"publisher","unstructured":"Bernstein, A., Chen, J., Dudeja, A., Langley, Z., Sidford, A., Tu, T.: Matching composition and efficient weight reduction in dynamic matching. In: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2991\u20133028 (2025). https:\/\/doi.org\/10.1137\/1.9781611978322.97","DOI":"10.1137\/1.9781611978322.97"},{"key":"25_CR5","doi-asserted-by":"publisher","unstructured":"Bernstein, A., Dudeja, A., Langley, Z.: A framework for dynamic matching in weighted graphs. In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (STOC), pp. 668\u2013681 (2021). https:\/\/doi.org\/10.1145\/3406325.345111","DOI":"10.1145\/3406325.345111"},{"key":"25_CR6","doi-asserted-by":"publisher","unstructured":"Blikstad, J.: Breaking o(nr) for matroid intersection. In: 48th International Colloquium on Automata, Languages, and Programming (ICALP), pp. 31:1\u201331:17 (2021). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2021.31","DOI":"10.4230\/LIPIcs.ICALP.2021.31"},{"key":"25_CR7","doi-asserted-by":"publisher","unstructured":"Blikstad, J., Tu, T.: Efficient matroid intersection via a batch-update auction algorithm. In: 2025 Symposium on Simplicity in Algorithms (SOSA), pp. 226\u2013237 (2025). https:\/\/doi.org\/10.1137\/1.9781611978315.18","DOI":"10.1137\/1.9781611978315.18"},{"key":"25_CR8","doi-asserted-by":"publisher","unstructured":"Blikstad, J., Van Den, Brand, J., Mukhopadhyay, S., Nanongkai, D.: Breaking the quadratic barrier for matroid intersection. In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (STOC), pp. 421\u2013432 (2021). https:\/\/doi.org\/10.1145\/3406325.345109","DOI":"10.1145\/3406325.345109"},{"key":"25_CR9","doi-asserted-by":"publisher","unstructured":"Chakrabarty, D., Lee, Y.T., Sidford, A., Singla, S., Wong, S.C.W.: Faster matroid intersection. In: 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), pp. 1146\u20131168. IEEE (2019). https:\/\/doi.org\/10.1109\/FOCS.2019.00072","DOI":"10.1109\/FOCS.2019.00072"},{"key":"25_CR10","doi-asserted-by":"publisher","unstructured":"Chekuri, C., Quanrud, K.: A fast approximation for maximum weight matroid intersection. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 445\u2013457 (2016). https:\/\/doi.org\/10.1137\/1.9781611974331.ch33","DOI":"10.1137\/1.9781611974331.ch33"},{"key":"25_CR11","doi-asserted-by":"publisher","unstructured":"Crouch, M.S., Stubbs, D.M.: Improved streaming algorithms for weighted matching, via unweighted matching. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM). LIPIcs, vol. 28, pp. 96\u2013104 (2014). https:\/\/doi.org\/10.4230\/LIPIcs.APPROX-RANDOM.2014.96","DOI":"10.4230\/LIPIcs.APPROX-RANDOM.2014.96"},{"issue":"4","key":"25_CR12","doi-asserted-by":"publisher","first-page":"948","DOI":"10.1137\/0215066","volume":"15","author":"WH Cunningham","year":"1986","unstructured":"Cunningham, W.H.: Improved bounds for matroid partition and intersection algorithms. SIAM J. Comput. 15(4), 948\u2013957 (1986). https:\/\/doi.org\/10.1137\/0215066","journal-title":"SIAM J. Comput."},{"key":"25_CR13","doi-asserted-by":"publisher","unstructured":"Edmonds, J.: Submodular functions, matroids, and certain polyhedra. In: Combinatorial Optimization\u2014Eureka, You Shrink! Papers Dedicated to Jack Edmonds 5th International Workshop Aussois, France, 5\u20139 March 2001, pp. 11\u201326 (2003). https:\/\/doi.org\/10.1007\/3-540-36478-1","DOI":"10.1007\/3-540-36478-1"},{"key":"25_CR14","doi-asserted-by":"publisher","unstructured":"Garg, P., Jordan, L., Svensson, O.: Semi-streaming algorithms for submodular matroid intersection. In: Integer Programming and Combinatorial Optimization - 22nd International Conference (IPCO) (2021). https:\/\/doi.org\/10.1007\/978-3-030-73879-215","DOI":"10.1007\/978-3-030-73879-215"},{"key":"25_CR15","doi-asserted-by":"publisher","unstructured":"Goel, A., Kapralov, M., Khanna, S.: On the communication and streaming complexity of maximum bipartite matching. In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 468\u2013485 (2012). https:\/\/doi.org\/10.1137\/1.9781611973099.41","DOI":"10.1137\/1.9781611973099.41"},{"key":"25_CR16","doi-asserted-by":"publisher","unstructured":"Gupta, M., Peng, R.: Fully dynamic (1+ e)-approximate matchings. In: 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 548\u2013557 (2013). https:\/\/doi.org\/10.1109\/FOCS.2013.65","DOI":"10.1109\/FOCS.2013.65"},{"key":"25_CR17","doi-asserted-by":"publisher","unstructured":"Hashemi, D., Wrzos-Kaminska, W.: Weighted matching in the random-order streaming and robust communication models. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM), pp. 16:1\u201316:26 (2024). https:\/\/doi.org\/10.4230\/LIPIcs.APPROX\/RANDOM.2024.16","DOI":"10.4230\/LIPIcs.APPROX\/RANDOM.2024.16"},{"key":"25_CR18","doi-asserted-by":"publisher","unstructured":"Huang, C., Kakimura, N., Kamiyama, N.: Exact and approximation algorithms for weighted matroid intersection. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 430\u2013444 (2016). https:\/\/doi.org\/10.1137\/1.9781611974331.ch32","DOI":"10.1137\/1.9781611974331.ch32"},{"key":"25_CR19","doi-asserted-by":"publisher","unstructured":"Huang, C., Sellier, F.: Maximum weight b-matchings in random-order streams. In: 30th Annual European Symposium on Algorithms (ESA), pp. 68:1\u201368:14 (2022). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2022.68","DOI":"10.4230\/LIPIcs.ESA.2022.68"},{"key":"25_CR20","doi-asserted-by":"publisher","unstructured":"Huang, C., Sellier, F.: Robust sparsification for matroid intersection with applications. In: Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2916\u20132940 (2024). https:\/\/doi.org\/10.1137\/1.9781611977912.10","DOI":"10.1137\/1.9781611977912.10"},{"key":"25_CR21","doi-asserted-by":"publisher","unstructured":"Huang, S.E., Su, H.H.: (1-eps)-approximate maximum weighted matching in poly (1\/eps, log n) time in the distributed and parallel settings. In: ACM Symposium on Principles of Distributed Computing (2023). https:\/\/doi.org\/10.1145\/3583668.3594570","DOI":"10.1145\/3583668.3594570"},{"issue":"1","key":"25_CR22","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1137\/S0097539799361208","volume":"31","author":"M Kao","year":"2001","unstructured":"Kao, M., Lam, T.W., Sung, W., Ting, H.: A decomposition theorem for maximum weight bipartite matchings. SIAM J. Comput. 31(1), 18\u201326 (2001). https:\/\/doi.org\/10.1137\/S0097539799361208","journal-title":"SIAM J. Comput."},{"key":"25_CR23","doi-asserted-by":"crossref","unstructured":"Kapralov, M.: Space lower bounds for approximating maximum matching in the edge arrival model. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1874\u20131893 (2021)","DOI":"10.1137\/1.9781611976465.112"},{"issue":"1","key":"25_CR24","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/BF01681329","volume":"9","author":"EL Lawler","year":"1975","unstructured":"Lawler, E.L.: Matroid intersection algorithms. Math. Program. 9(1), 31\u201356 (1975)","journal-title":"Math. Program."},{"key":"25_CR25","doi-asserted-by":"publisher","unstructured":"Liu, Q.C., Ke, Y., Khuller, S.: Scalable auction algorithms for bipartite maximum matching problems. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM), pp. 28:1\u201328:24 (2023). https:\/\/doi.org\/10.4230\/LIPIcs.APPROX\/RANDOM.2023.28","DOI":"10.4230\/LIPIcs.APPROX\/RANDOM.2023.28"},{"key":"25_CR26","unstructured":"Nguyen, H.L.: A note on cunningham\u2019s algorithm for matroid intersection. arXiv preprint arXiv:1904.04129 (2019)"},{"key":"25_CR27","doi-asserted-by":"publisher","unstructured":"Quanrud, K.: Adaptive sparsification for matroid intersection. In: 51st International Colloquium on Automata, Languages, and Programming (ICALP), pp. 118:1\u2013118:20 (2024). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2024.118","DOI":"10.4230\/LIPIcs.ICALP.2024.118"},{"key":"25_CR28","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency, vol. 24. Springer (2003)"},{"key":"25_CR29","doi-asserted-by":"publisher","unstructured":"Terao, T.: Deterministic (2\/3-$$\\epsilon $$)-approximation of matroid intersection using nearly-linear independence-oracle queries. CoRR abs\/2410.18820 (2024). https:\/\/doi.org\/10.48550\/arXiv.2410.18820","DOI":"10.48550\/arXiv.2410.18820"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-28691-8_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T22:33:18Z","timestamp":1781303598000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-28691-8_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032286901","9783032286918"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-28691-8_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"13 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Padua","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/events.math.unipd.it\/ipco2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}