{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:27:14Z","timestamp":1743049634848,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031221040"},{"type":"electronic","value":"9783031221057"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-22105-7_39","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T02:36:12Z","timestamp":1672540572000},"page":"444-451","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Online Semi-matching Problem with\u00a0Two Heterogeneous Sensors in\u00a0a\u00a0Metric Space"],"prefix":"10.1007","author":[{"given":"Man","family":"Xiao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weidong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"issue":"1","key":"39_CR1","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/s10878-012-9581-9","volume":"27","author":"BM Anthony","year":"2014","unstructured":"Anthony, B.M., Chung, C.: Online bottleneck matching. J. Combin. Optim. 27(1), 100\u2013114 (2014). https:\/\/doi.org\/10.1007\/s10878-012-9581-9","journal-title":"J. Combin. Optim."},{"key":"39_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"},{"key":"39_CR3","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). https:\/\/doi.org\/10.1007\/s00453-012-9676-9","journal-title":"Algorithmica"},{"issue":"1","key":"39_CR4","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. Theor. Comput. Sci. 332(1), 251\u2013264 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"39_CR5","doi-asserted-by":"publisher","unstructured":"Gupta, A., Lewi, K.: The online metric matching problem for doubling metrics. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) Automata, Languages, and Programming, ICALP 2012. LNCS, vol. 7391, pp. 424\u2013435. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31594-7_36","DOI":"10.1007\/978-3-642-31594-7_36"},{"key":"39_CR6","unstructured":"Idury, R., Schaffer, A.A.: A better lower bound for on-line bottleneck matching (1992)"},{"key":"39_CR7","doi-asserted-by":"publisher","first-page":"2150156","DOI":"10.1142\/S1793830921501561","volume":"13","author":"T Itoh","year":"2021","unstructured":"Itoh, T., Miyazaki, S., Satake, M.: Competitive analysis for two variants of online metric matching problem. Discret. Math. Algorithms Appl. 13, 2150156 (2021)","journal-title":"Discret. Math. Algorithms Appl."},{"key":"39_CR8","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"},{"issue":"2","key":"39_CR9","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0304-3975(94)90042-6","volume":"127","author":"S Khuller","year":"1994","unstructured":"Khuller, S., Mitchell, S.G., Vazirani, V.V.: On-line algorithms for weighted bipartite matching and stable marriages. Theoret. Comput. Sci. 127(2), 255\u2013267 (1994)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"39_CR10","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1051\/ro\/2015010","volume":"50","author":"W Li","year":"2016","unstructured":"Li, W., Li, J., Guan, L., Shi, Y.: The prize-collecting call control problem on weighted lines and rings. RAIRO-Oper. Res. 50(1), 39\u201346 (2016)","journal-title":"RAIRO-Oper. Res."},{"key":"39_CR11","doi-asserted-by":"crossref","unstructured":"Meyerson, A., Nanavati, A., Poplawski, L.: Randomized online algorithms for minimum metric bipartite matching. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm(SODA), pp 954\u2013959 (2006)","DOI":"10.1145\/1109557.1109662"},{"key":"39_CR12","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":"39_CR13","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 103 (2021)"},{"key":"39_CR14","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":"39_CR15","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)"},{"key":"39_CR16","doi-asserted-by":"publisher","unstructured":"Xiao, M., Zhao, S., Li, W., Yang, J.: Online bottleneck semi-matching. In: Du, D.-Z., Du, D., Wu, C., Xu, D. (eds.) Combinatorial Optimization and Applications, COCOA 2021. LNCS, vol. 13135, pp. 445\u2013455. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92681-6_35","DOI":"10.1007\/978-3-030-92681-6_35"}],"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-22105-7_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,30]],"date-time":"2023-03-30T22:06:00Z","timestamp":1680213960000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22105-7_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031221040","9783031221057"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22105-7_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 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":"Shenzhen","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2022\/","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":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"101","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":"39","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":"12","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":"39% - 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":"5","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)"}}]}}