{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T05:39:20Z","timestamp":1740807560344,"version":"3.38.0"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2024,3,6]],"date-time":"2024-03-06T00:00:00Z","timestamp":1709683200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,3,6]],"date-time":"2024-03-06T00:00:00Z","timestamp":1709683200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100010663","name":"H2020 European Research Council","doi-asserted-by":"publisher","award":["101019564"],"award-info":[{"award-number":["101019564"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["P 33775-N"],"award-info":[{"award-number":["P 33775-N"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s10107-024-02066-3","type":"journal-article","created":{"date-parts":[[2024,3,6]],"date-time":"2024-03-06T14:02:52Z","timestamp":1709733772000},"page":"881-894","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Multiplicative auction algorithm for approximate maximum weight bipartite matching"],"prefix":"10.1007","volume":"210","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0844-9457","authenticated-orcid":false,"given":"Da Wei","family":"Zheng","sequence":"first","affiliation":[]},{"given":"Monika","family":"Henzinger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,6]]},"reference":[{"issue":"1\u20132","key":"2066_CR1","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10107-018-1244-x","volume":"175","author":"Z Allen-Zhu","year":"2019","unstructured":"Allen-Zhu, Z., Orecchia, L.: Nearly linear-time packing and covering LP solvers - achieving width-independence and -convergence. Math. Program. 175(1\u20132), 307\u2013353 (2019). https:\/\/doi.org\/10.1007\/s10107-018-1244-x","journal-title":"Math. Program."},{"key":"2066_CR2","doi-asserted-by":"publisher","unstructured":"Assadi, S.: A simple (1-$$\\epsilon $$)-approximation semi-streaming algorithm for maximum (weighted) matching (2023) https:\/\/doi.org\/10.48550\/arXiv.2307.02968","DOI":"10.48550\/arXiv.2307.02968"},{"key":"2066_CR3","doi-asserted-by":"publisher","unstructured":"Assadi, S., Liu, S.C., Tarjan, R.E.: An auction algorithm for bipartite matching in streaming and massively parallel computation models. In: Le, H.V., King, V. (eds.), 4th Symposium on Simplicity in Algorithms, SOSA 2021, Virtual Conference, January 11\u201312, 2021. SIAM, pp. 165\u2013171 (2021) https:\/\/doi.org\/10.1137\/1.9781611976496.18","DOI":"10.1137\/1.9781611976496.18"},{"key":"2066_CR4","doi-asserted-by":"publisher","unstructured":"Bernstein, A., Gutenberg, M.P., Saranurak, T.: Deterministic decremental reachability, scc, and shortest paths via directed expanders and congestion balancing. In: Irani, S. (ed.) 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, November 16\u201319, 2020. IEEE, pp. 1123\u20131134 (2020) https:\/\/doi.org\/10.1109\/FOCS46700.2020.00108","DOI":"10.1109\/FOCS46700.2020.00108"},{"key":"2066_CR5","doi-asserted-by":"publisher","unstructured":"Bernstein, A., Dudeja, A., Langley, Z.: A framework for dynamic matching in weighted graphs. In: Khuller, S., Williams, V.V. (eds.) STOC \u201921: 53rd Annual ACM SIGACT Symposium on Theory of Computing, Virtual Event, Italy, June 21\u201325, 2021. ACM, pp. 668\u2013681 (2021). https:\/\/doi.org\/10.1145\/3406325.3451113","DOI":"10.1145\/3406325.3451113"},{"issue":"1","key":"2066_CR6","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/BF01584237","volume":"21","author":"DP Bertsekas","year":"1981","unstructured":"Bertsekas, D.P.: A new algorithm for the assignment problem. Math. Program. 21(1), 152\u2013171 (1981). https:\/\/doi.org\/10.1007\/BF01584237","journal-title":"Math. Program."},{"key":"2066_CR7","doi-asserted-by":"publisher","unstructured":"Bhattacharya, S., Kiss, P., Saranurak, T.: Dynamic algorithms for packing-covering lps via multiplicative weight updates (2022) https:\/\/doi.org\/10.48550\/arXiv.2207.07519","DOI":"10.48550\/arXiv.2207.07519"},{"key":"2066_CR8","doi-asserted-by":"publisher","unstructured":"Blikstad, J., Kiss, P.: Incremental (1-$$\\epsilon $$)-approximate dynamic matching in o(poly(1\/$$\\epsilon $$)) update time (2023) https:\/\/doi.org\/10.48550\/arXiv.2302.08432","DOI":"10.48550\/arXiv.2302.08432"},{"key":"2066_CR9","doi-asserted-by":"publisher","unstructured":"Bosek, B., Leniowski, D., Sankowski, P., et\u00a0al.: Online bipartite matching in offline time. In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, October 18\u201321, 2014. IEEE Computer Society, pp. 384\u2013393 (2014). https:\/\/doi.org\/10.1109\/FOCS.2014.48","DOI":"10.1109\/FOCS.2014.48"},{"key":"2066_CR10","doi-asserted-by":"publisher","unstructured":"Chekuri, C., Quanrud, K.: Randomized MWU for positive LPs. In: Czumaj, A. (ed.) Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7\u201310, 2018. SIAM, pp. 358\u2013377, (2018) https:\/\/doi.org\/10.1137\/1.9781611975031.25","DOI":"10.1137\/1.9781611975031.25"},{"key":"2066_CR11","doi-asserted-by":"publisher","unstructured":"Chen, L., Kyng, R., Liu, Y.P., et\u00a0al.: Maximum flow and minimum-cost flow in almost-linear time (2022) https:\/\/doi.org\/10.48550\/arXiv.2203.00671","DOI":"10.48550\/arXiv.2203.00671"},{"issue":"4","key":"2066_CR12","doi-asserted-by":"publisher","first-page":"863","DOI":"10.1086\/261411","volume":"94","author":"G Demange","year":"1986","unstructured":"Demange, G., Gale, D., Sotomayor, M.: Multi-item auctions. J. Polit. Econ. 94(4), 863\u2013872 (1986)","journal-title":"J. Polit. Econ."},{"issue":"1","key":"2066_CR13","doi-asserted-by":"publisher","first-page":"1:1","DOI":"10.1145\/2529989","volume":"61","author":"R Duan","year":"2014","unstructured":"Duan, R., Pettie, S.: Linear-time approximation for maximum weight matching. J. ACM 61(1), 1:1-1:23 (2014). https:\/\/doi.org\/10.1145\/2529989","journal-title":"J. ACM"},{"key":"2066_CR14","doi-asserted-by":"publisher","unstructured":"Gupta, M., Peng, R.: Fully dynamic $$(1+\\epsilon )$$-approximate matchings. In: 54th Symposium on Foundations of Computer Science, FOCS. IEEE Computer Society, pp. 548\u2013557 (2013). https:\/\/doi.org\/10.1109\/FOCS.2013.65","DOI":"10.1109\/FOCS.2013.65"},{"key":"2066_CR15","doi-asserted-by":"publisher","unstructured":"Hanauer, K., Henzinger, M., Schulz, C.: Recent advances in fully dynamic graph algorithms (invited talk). In: Aspnes, J., Michail, O. (eds.) 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28\u201330, 2022, Virtual Conference, LIPIcs, vol 221. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, pp. 1:1\u20131:47 (2022). https:\/\/doi.org\/10.4230\/LIPIcs.SAND.2022.1","DOI":"10.4230\/LIPIcs.SAND.2022.1"},{"key":"2066_CR16","doi-asserted-by":"publisher","unstructured":"Henzinger, M., Krinninger, S., Nanongkai, D., et\u00a0al.: Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture. In: Proc. of the forty-seventh annual ACM symposium on Theory of computing, pp. 21\u201330 (2015). https:\/\/doi.org\/10.1145\/2746539.2746609","DOI":"10.1145\/2746539.2746609"},{"issue":"4","key":"2066_CR17","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1007\/s00453-013-9771-6","volume":"70","author":"C Koufogiannakis","year":"2014","unstructured":"Koufogiannakis, C., Young, N.E.: A nearly linear-time PTAS for explicit fractional packing and covering linear programs. Algorithmica 70(4), 648\u2013674 (2014). https:\/\/doi.org\/10.1007\/s00453-013-9771-6","journal-title":"Algorithmica"},{"issue":"1\u20132","key":"2066_CR18","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Res. Logist. Quart. 2(1\u20132), 83\u201397 (1955)","journal-title":"Naval Res. Logist. Quart."},{"key":"2066_CR19","doi-asserted-by":"publisher","unstructured":"Le, H., Milenkovic, L., Solomon, S. et\u00a0al.: Dynamic matching algorithms under vertex updates. In: Braverman, M. (ed.) 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA, LIPIcs, vol 215. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, pp. 96:1\u201396:24, (2022) https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2022.96","DOI":"10.4230\/LIPIcs.ITCS.2022.96"},{"key":"2066_CR20","doi-asserted-by":"publisher","unstructured":"Liu, Q.C., Ke, Y., Khuller, S.: Scalable auction algorithms for bipartite maximum matching problems (2023) https:\/\/doi.org\/10.48550\/arXiv.2307.08979","DOI":"10.48550\/arXiv.2307.08979"},{"issue":"1","key":"2066_CR21","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1137\/0105003","volume":"5","author":"J Munkres","year":"1957","unstructured":"Munkres, J.: Algorithms for the assignment and transportation problems. J. Soc. Ind. Appl. Math. 5(1), 32\u201338 (1957)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"2066_CR22","doi-asserted-by":"publisher","unstructured":"Quanrud, K.: Nearly linear time approximations for mixed packing and covering problems without data structures or randomization. In: Farach-Colton, M., G\u00f8rtz, I.L. (eds.) 3rd Symposium on Simplicity in Algorithms, SOSA 2020, Salt Lake City, UT, USA, January 6\u20137, 2020. SIAM, pp. 69\u201380 (2020) https:\/\/doi.org\/10.1137\/1.9781611976014.11","DOI":"10.1137\/1.9781611976014.11"},{"key":"2066_CR23","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A., et al.: Combinatorial Optimization: Polyhedra and Efficiency, vol. 24. Springer, Berlin (2003)"},{"key":"2066_CR24","doi-asserted-by":"publisher","unstructured":"Wang, D., Rao, S., Mahoney, M.W.: Unified acceleration method for packing and covering problems via diameter reduction. In: Chatzigiannakis, I., Mitzenmacher, M., Rabani, Y., et\u00a0al. (eds.) 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11\u201315, 2016, Rome, Italy, LIPIcs, vol\u00a055. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, pp. 50:1\u201350:13, (2016). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2016.50","DOI":"10.4230\/LIPIcs.ICALP.2016.50"},{"key":"2066_CR25","unstructured":"Young, N.E.: Nearly linear-time approximation schemes for mixed packing\/covering and facility-location linear programs (2014) arxiv:1407.3015"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-024-02066-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-024-02066-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-024-02066-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T15:49:51Z","timestamp":1740757791000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-024-02066-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,6]]},"references-count":25,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["2066"],"URL":"https:\/\/doi.org\/10.1007\/s10107-024-02066-3","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2024,3,6]]},"assertion":[{"value":"6 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 January 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 March 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"There are no conflicts of interests or competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}