{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T17:26:25Z","timestamp":1744133185098,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031491924"},{"type":"electronic","value":"9783031491931"}],"license":[{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-49193-1_18","type":"book-chapter","created":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:02:36Z","timestamp":1702026156000},"page":"238-249","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Deterministic Primal-Dual Algorithms for\u00a0Online k-Way Matching with\u00a0Delays"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3918-3479","authenticated-orcid":false,"given":"Naonori","family":"Kakimura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomohiro","family":"Nakayoshi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,9]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, G., Goel, G., Karande, C., Mehta, A.: Online vertex-weighted bipartite matching and single-bid budgeted allocations. In: Proceedings of the 2011 Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1253\u20131264. SODA 2011, SIAM (2011)","DOI":"10.1137\/1.9781611973082.95"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"2917","DOI":"10.1007\/s00453-019-00565-w","volume":"81","author":"A Antoniadis","year":"2019","unstructured":"Antoniadis, A., Barcelo, N., Nugent, M., Pruhs, K., Scquizzato, M.: A $$o(n)$$-competitive deterministic algorithm for online matching on a line. Algorithmica 81, 2917\u20132933 (2019)","journal-title":"Algorithmica"},{"issue":"2","key":"18_CR3","doi-asserted-by":"publisher","first-page":"999","DOI":"10.1287\/moor.2022.1289","volume":"48","author":"I Ashlagi","year":"2023","unstructured":"Ashlagi, I., Burq, M., Dutta, C., Jaillet, P., Saberi, A., Sholley, C.: Edge-weighted online windowed matching. Math. Oper. Res. 48(2), 999\u20131016 (2023)","journal-title":"Math. Oper. Res."},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Assaf, S., Pal, K.: Partial n-metric spaces and fixed point theorems (2015). arXiv: 1502.05320","DOI":"10.1186\/s13663-015-0260-2"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Azar, Y., Chiplunkar, A., Kaplan, H.: Polylogarithmic bounds on the competitiveness of min-cost perfect matching with delays. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017), pp. 1051\u20131061. SIAM (2017)","DOI":"10.1137\/1.9781611974782.67"},{"issue":"4","key":"18_CR6","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/s00224-019-09963-7","volume":"64","author":"Y Azar","year":"2020","unstructured":"Azar, Y., Jacob Fanani, A.: Deterministic min-cost matching with delays. Theor. Comput. Syst. 64(4), 572\u2013592 (2020)","journal-title":"Theor. Comput. Syst."},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Azar, Y., Ren, R., Vainstein, D.: The min-cost matching with concave delays problem. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, pp. 301\u2013320. SODA 2021, SIAM (2021)","DOI":"10.1137\/1.9781611976465.20"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1007\/978-3-540-75520-3_47","volume-title":"Algorithms \u2013 ESA 2007","author":"N Bansal","year":"2007","unstructured":"Bansal, N., Buchbinder, N., Gupta, A., Naor, J.S.: An O(log2k)-competitive algorithm for metric bipartite matching. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 522\u2013533. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75520-3_47"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-030-04693-4_4","volume-title":"Approximation and Online Algorithms","author":"M Bienkowski","year":"2018","unstructured":"Bienkowski, M., Kraska, A., Liu, H.-H., Schmidt, P.: A primal-dual online deterministic algorithm for matching with delays. In: Epstein, L., Erlebach, T. (eds.) WAOA 2018. LNCS, vol. 11312, pp. 51\u201368. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-04693-4_4"},{"key":"18_CR10","unstructured":"Deryckere, L., Umboh, S.W.: Online matching with set and concave delays (2023). arXiv: 2211.02394"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Emek, Y., Kutten, S., Wattenhofer, R.: Online matching: haste makes waste! In: Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing, pp. 333\u2013344. STOC 2016, ACM (2016)","DOI":"10.1145\/2897518.2897557"},{"issue":"1","key":"18_CR12","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/j.tcs.2004.10.028","volume":"332","author":"B Fuchs","year":"2005","unstructured":"Fuchs, B., Hochst\u00e4ttler, W., Kern, W.: Online matching on a line. Theoret. Comput. Sci. 332(1), 251\u2013264 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"18_CR13","unstructured":"Goel, G., Mehta, A.: Online budgeted matching in random input models with applications to Adwords. In: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 982\u2013991. SODA 2008, SIAM (2008)"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/978-3-642-31594-7_36","volume-title":"Automata, Languages, and Programming","author":"A Gupta","year":"2012","unstructured":"Gupta, A., Lewi, K.: The online metric matching problem for doubling metrics. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012. LNCS, vol. 7391, pp. 424\u2013435. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31594-7_36"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Karp, R.M., Vazirani, U.V., Vazirani, V.V.: An optimal algorithm for on-line bipartite matching. In: Proceedings of the Twenty-Second Annual ACM Symposium on Theory of Computing, pp. 352\u2013358. STOC 1990, ACM (1990)","DOI":"10.1145\/100216.100262"},{"issue":"7","key":"18_CR16","first-page":"2520","volume":"3","author":"KA Khan","year":"2012","unstructured":"Khan, K.A.: On the possibitity of N-topological spaces. Int. J. Math. Arch. 3(7), 2520\u20132523 (2012)","journal-title":"Int. J. Math. Arch."},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-540-24592-6_14","volume-title":"Approximation and Online Algorithms","author":"E Koutsoupias","year":"2004","unstructured":"Koutsoupias, E., Nanavati, A.: The online matching problem on a line. In: Solis-Oba, R., Jansen, K. (eds.) WAOA 2003. LNCS, vol. 2909, pp. 179\u2013191. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24592-6_14"},{"key":"18_CR18","unstructured":"Liu, X., Pan, Z., Wang, Y., Wattenhofer, R.: Impatient online matching. In: 29th International Symposium on Algorithms and Computation, ISAAC 2018. LIPIcs, vol. 123, pp. 62:1\u201362:12. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018)"},{"key":"18_CR19","unstructured":"Liu, X., Pan, Z., Wang, Y., Wattenhofer, R.: Online matching with convex delay costs (2022). arXiv:2203.03335"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Mehta, A., Saberi, A., Vazirani, U., Vazirani, V.: AdWords and generalized on-line matching. In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), pp. 264\u2013273 (2005)","DOI":"10.1109\/SFCS.2005.12"},{"issue":"4","key":"18_CR21","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1561\/0400000057","volume":"8","author":"A Mehta","year":"2013","unstructured":"Mehta, A.: Online matching and ad allocation. Found. Trends Theor. Comput. Sci. 8(4), 265\u2013368 (2013)","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"18_CR22","unstructured":"Melnyk, D., Wang, Y., Wattenhofer, R.: Online $$k$$-Way Matching with Delays and the $$H$$-Metric (2021). arXiv:2109.06640"},{"key":"18_CR23","doi-asserted-by":"crossref","unstructured":"Nayyar, K., Raghvendra, S.: An input sensitive online algorithm for the metric bipartite matching problem. In: 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS 2017), pp. 505\u2013515 (2017)","DOI":"10.1109\/FOCS.2017.53"},{"issue":"4","key":"18_CR24","doi-asserted-by":"publisher","first-page":"2194","DOI":"10.1287\/opre.2022.2277","volume":"70","author":"M Pavone","year":"2022","unstructured":"Pavone, M., Saberi, A., Schiffer, M., Tsao, M.W.: Technical note-online hypergraph matching with delays. Oper. Res. 70(4), 2194\u20132212 (2022)","journal-title":"Oper. Res."},{"key":"18_CR25","unstructured":"Raghvendra, S.: A robust and optimal online algorithm for minimum metric bipartite matching. In: International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2016). LIPIcs, vol. 60, pp. 18:1\u201318:16. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2016)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49193-1_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,5]],"date-time":"2024-11-05T16:27:51Z","timestamp":1730824071000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49193-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,9]]},"ISBN":["9783031491924","9783031491931"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49193-1_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,9]]},"assertion":[{"value":"9 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hawaii, HI","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":"15 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOON2023\/org.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Springer EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"146","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":"60","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":"41% - 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":"6","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}