{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:05:27Z","timestamp":1743113127014,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030926809"},{"type":"electronic","value":"9783030926816"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-92681-6_35","type":"book-chapter","created":{"date-parts":[[2021,12,10]],"date-time":"2021-12-10T14:20:26Z","timestamp":1639146026000},"page":"445-455","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Online Bottleneck Semi-matching"],"prefix":"10.1007","author":[{"given":"Man","family":"Xiao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shu","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weidong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinhua","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,11]]},"reference":[{"key":"35_CR1","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1016\/j.tcs.2019.08.011","volume":"806","author":"AR Ahmed","year":"2020","unstructured":"Ahmed, A.R., Rahman, M.S., Kobourov, S.: Online facility assignment. Theoret. Comput. Sci. 806, 455\u2013467 (2020)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"35_CR2","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/s10878-012-9581-9","volume":"27","author":"BM Anthony","year":"2012","unstructured":"Anthony, B.M., Chung, C.: Online bottleneck matching. J. Comb. Optim. 27(1), 100\u2013114 (2012). https:\/\/doi.org\/10.1007\/s10878-012-9581-9","journal-title":"J. Comb. Optim."},{"issue":"4","key":"35_CR3","doi-asserted-by":"publisher","first-page":"1232","DOI":"10.1007\/s10878-015-9948-9","volume":"32","author":"BM Anthony","year":"2015","unstructured":"Anthony, B.M., Chung, C.: Serve or skip: the power of rejection in online bottleneck matching. J. Comb. Optim. 32(4), 1232\u20131253 (2015). https:\/\/doi.org\/10.1007\/s10878-015-9948-9","journal-title":"J. Comb. Optim."},{"key":"35_CR4","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"},{"key":"35_CR5","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/s00453-012-9676-9","volume":"68","author":"N Bansal","year":"2014","unstructured":"Bansal, N., Buchbinder, N., Gupta, A., Naor, J.S.: A randomized $$O(\\log ^2k)$$-competitive algorithm for metric bipartite matching. Algorithmica 68, 390\u2013403 (2014)","journal-title":"Algorithmica"},{"issue":"1","key":"35_CR6","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., Hochstattler, W., Kern, W.: Online matching on a line. Theoret. Comput. Sci. 332(1), 251\u2013264 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"Gupta, A., Lewi, K.: The online metric matching problem for doubling metrics. In: Proceedings of International Colloquium on Automata, Languages, and Programming (ICALP), pp. 424\u2013435 (2012)","DOI":"10.1007\/978-3-642-31594-7_36"},{"key":"35_CR8","unstructured":"Idury, R., Schaffer, A.A.: A better lower bound for on-line bottleneck matching, manuscript (1992)"},{"key":"35_CR9","doi-asserted-by":"crossref","unstructured":"Itoh, T., Miyazaki, S., Satake, M.: Competitive analysis for two variants of online metric matching problem, Discrete Mathematics, Algorithms and Applications, ID 2150156 (2021)","DOI":"10.1142\/S1793830921501561"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"Kalyanasundaram, B., Pruhs, K.: Online weighted matching. J. Algorithms 14(3), 478\u2013488 (1993) Preliminary version appeared in Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete algorithms (SODA), pp. 234\u2013240 (1991)","DOI":"10.1006\/jagm.1993.1026"},{"key":"35_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/BFb0029573","volume-title":"Online Algorithms","author":"B Kalyanasundaram","year":"1998","unstructured":"Kalyanasundaram, B., Pruhs, K.: On-line network optimization problems. In: Fiat, A., Woeginger, G.J. (eds.) Online Algorithms. LNCS, vol. 1442, pp. 268\u2013280. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0029573"},{"issue":"3","key":"35_CR12","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1137\/S0895480198342310","volume":"13","author":"B Kalyanasundaram","year":"2000","unstructured":"Kalyanasundaram, B., Pruhs, K.: The online transportation problem. SIAM J. Discret. Math. 13(3), 370\u2013383 (2000)","journal-title":"SIAM J. Discret. Math."},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"Nayyar, K., Raghvendra, S.: An input sensitive online algorithm for the metric bipartite matching problem. In: Proceedings of IEEE 58th Annual Symposium on Foundations of Computer Science, pp. 505\u2013515 (2017)","DOI":"10.1109\/FOCS.2017.53"},{"key":"35_CR14","unstructured":"Peserico, E., Scquizzato, M.: Matching on the line admits no $$o(\\sqrt{\\log n})$$-competitive algorithm. In: Proceedings of the 48th International Colloquium on Automata, Languages, and Programming (ICALP), Article No. 103 (2021)"},{"key":"35_CR15","unstructured":"Raghvendra, S.: A robust and optimal online algorithm for minimum metric bipartite matching. In: Proceedings of Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2016), ID 18 (2016)"},{"key":"35_CR16","unstructured":"Raghvendra, S.: Optimal analysis of an online algorithm for the bipartite matching problem on a line. In: Proceedings of 34th International Symposium on Computational Geometry, ID 67 (2017)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-92681-6_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,13]],"date-time":"2021-12-13T00:07:11Z","timestamp":1639354031000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-92681-6_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030926809","9783030926816"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-92681-6_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"11 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tianjin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/lxy.tjut.edu.cn\/COCOA2021\/COCOA_2021.htm","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62","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":"16","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":"8","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":"26% - 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":"4.2","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.75","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)"}}]}}