{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:21:14Z","timestamp":1742959274964,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031327254"},{"type":"electronic","value":"9783031327261"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-32726-1_32","type":"book-chapter","created":{"date-parts":[[2023,5,21]],"date-time":"2023-05-21T20:28:43Z","timestamp":1684700923000},"page":"453-465","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Multiplicative Auction Algorithm for\u00a0Approximate Maximum Weight Bipartite Matching"],"prefix":"10.1007","author":[{"given":"Da Wei","family":"Zheng","sequence":"first","affiliation":[]},{"given":"Monika","family":"Henzinger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,22]]},"reference":[{"issue":"1\u20132","key":"32_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)","journal-title":"Math. Program."},{"issue":"1","key":"32_CR2","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)","journal-title":"Math. Program."},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"Bhattacharya, S., Kiss, P., Saranurak, T.: Dynamic algorithms for packing-covering lPS via multiplicative weight updates. CoRR, abs\/2207.07519 (2022)","DOI":"10.1137\/1.9781611977554.ch1"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"Bosek, B., Leniowski, D., Sankowski, P., Zych, A.: 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, pp. 384\u2013393. IEEE Computer Society (2014)","DOI":"10.1109\/FOCS.2014.48"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Chekuri, C., Quanrud, K.: Randomized MWU for positive lPS. In: Czumaj, A., editor, Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7\u201310, 2018, pp. 358\u2013377. SIAM (2018)","DOI":"10.1137\/1.9781611975031.25"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Chen, L., Kyng, R., Liu, Y.P., Peng, R., Gutenberg, M.P., Sachdeva, S.: Maximum flow and minimum-cost flow in almost-linear time. CoRR, abs\/2203.00671 (2022)","DOI":"10.1109\/FOCS54457.2022.00064"},{"issue":"4","key":"32_CR7","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":"32_CR8","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)","journal-title":"J. ACM"},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"Gupta, M., Peng, R.: Fully dynamic $$(1+\\epsilon )$$-approximate matchings. In: 54th Symposium on Foundations of Computer Science, FOCS, pp. 548\u2013557. IEEE Computer Society (2013)","DOI":"10.1109\/FOCS.2013.65"},{"key":"32_CR10","unstructured":"Hanauer, K., Henzinger, M., Schulz, C.: Recent advances in fully dynamic graph algorithms (invited talk). In: Aspnes, J., Michail, O., editors, 1st Symposium on Algorithmic Foundations of Dynamic Networks, SAND 2022, March 28\u201330, 2022, Virtual Conference, volume 221 of LIPIcs, pp. 1:1\u20131:47. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"Henzinger, M., Krinninger, S., Nanongkai, D., Saranurak, T.: Unifying and strengthening hardness for dynamic problems via the online matrix-vector multiplication conjecture. In Proceedings of the Forty-Seventh Annual ACM Symposium on Theory of Computing, pp. 21\u201330 (2015)","DOI":"10.1145\/2746539.2746609"},{"issue":"4","key":"32_CR12","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)","journal-title":"Algorithmica"},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"Kuhn, H.W.: The hungarian method for the assignment problem. Naval Research Logistics Quarterly, 2(1\u20132), 83\u201397 (1955)","DOI":"10.1002\/nav.3800020109"},{"key":"32_CR14","unstructured":"Le, H., Milenkovic, L., Solomon, S., Williams, V.V.: Dynamic matching algorithms under vertex updates. In: Braverman, M., editor, 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA, volume 215 of LIPIcs, pp. 96:1\u201396:24. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"issue":"1","key":"32_CR15","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":"32_CR16","doi-asserted-by":"crossref","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., editors, 3rd Symposium on Simplicity in Algorithms, SOSA 2020, Salt Lake City, UT, USA, January 6\u20137, 2020, pp. 69\u201380. SIAM (2020)","DOI":"10.1137\/1.9781611976014.11"},{"key":"32_CR17","unstructured":"Schrijver, A., et al.: Combinatorial Optimization: Polyhedra and Efficiency, vol. 24. Springer (2003)"},{"key":"32_CR18","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., Sangiorgi, D., editors, 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 11\u201315, 2016, Rome, Italy, vol. 55 of LIPIcs, pp. 50:1\u201350:13. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016)"},{"key":"32_CR19","unstructured":"Young, N.E.: Nearly linear-time approximation schemes for mixed packing\/covering and facility-location linear programs. CoRR, abs\/1407.3015 (2014)"}],"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-031-32726-1_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,21]],"date-time":"2023-05-21T20:31:40Z","timestamp":1684701100000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-32726-1_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031327254","9783031327261"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-32726-1_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"22 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"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":"Madison, WI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/optimization.discovery.wisc.edu\/ipco-2023-madison\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"119","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}