{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:07:11Z","timestamp":1743080831538,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030950170"},{"type":"electronic","value":"9783030950187"}],"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.springer.com\/tdm"},{"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.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-95018-7_18","type":"book-chapter","created":{"date-parts":[[2022,1,24]],"date-time":"2022-01-24T00:05:04Z","timestamp":1642982704000},"page":"224-236","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Algorithms for\u00a0Online Car-Sharing Problem"],"prefix":"10.1007","author":[{"given":"Xiangyu","family":"Guo","sequence":"first","affiliation":[]},{"given":"Kelin","family":"Luo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,24]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Ascheuer, N., Krumke, S.O., Rambau, J.: Online dial-a-ride problems: minimizing the completion time. In: Annual Symposium on Theoretical Aspects of Computer Science, pp. 639\u2013650 (2000)","DOI":"10.1007\/3-540-46541-3_53"},{"key":"18_CR2","unstructured":"Bei, X., Zhang, S.: Algorithms for trip-vehicle assignment in ride-sharing. In: McIlraith, S.A., Weinberger, K.Q. (eds.) Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, (AAAI-18), the 30th Innovative Applications of Artificial Intelligence (IAAI-18), and the 8th AAAI Symposium on Educational Advances in Artificial Intelligence (EAAI-18), New Orleans, Louisiana, USA, 2\u20137 February 2018, pp. 3\u20139. AAAI Press (2018)"},{"key":"18_CR3","unstructured":"Bienkowski, M., Kraska, A., Liu, H.H.: Traveling repairperson, unrelated machines, and other stories about average completion times. In: International Colloquium on Automata, Languages and Programming (ICALP) (2021)"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Charikar, M., Raghavachari, B.: The finite capacity dial-a-ride problem. In: Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No. 98CB36280), pp. 458\u2013467 (1998)","DOI":"10.1109\/SFCS.1998.743496"},{"issue":"1","key":"18_CR5","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/S0304-3975(00)00261-9","volume":"268","author":"E Feuerstein","year":"2001","unstructured":"Feuerstein, E., Stougie, L.: On-line single-server dial-a-ride problems. Theoret. Comput. Sci. 268(1), 91\u2013105 (2001)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"18_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2629653","volume":"11","author":"IL G\u00f8rtz","year":"2015","unstructured":"G\u00f8rtz, I.L., Nagarajan, V., Ravi, R.: Minimum makespan multi-vehicle dial-a-ride. ACM Trans. Algorithms (TALG) 11(3), 1\u201329 (2015)","journal-title":"ACM Trans. Algorithms (TALG)"},{"issue":"2","key":"18_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1721837.1721857","volume":"6","author":"A Gupta","year":"2010","unstructured":"Gupta, A., Hajiaghayi, M., Nagarajan, V., Ravi, R.: Dial a ride from k-forest. ACM Trans. Algorithms (TALG) 6(2), 1\u201321 (2010)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Joshi, M., Singh, A., Ranu, S., Bagchi, A., Karia, P., Kala, P.: Batching and matching for food delivery in dynamic road networks. In: 2021 IEEE 37th International Conference on Data Engineering (ICDE), pp. 2099\u20132104. IEEE (2021)","DOI":"10.1109\/ICDE51399.2021.00207"},{"issue":"3","key":"18_CR9","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1006\/jagm.1993.1026","volume":"14","author":"B Kalyanasundaram","year":"1993","unstructured":"Kalyanasundaram, B., Pruhs, K.: Online weighted matching. J. Algorithms 14(3), 478\u2013488 (1993)","journal-title":"J. Algorithms"},{"key":"18_CR10","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_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-030-58150-3_21","volume-title":"Computing and Combinatorics","author":"K Luo","year":"2020","unstructured":"Luo, K., Spieksma, F.C.R.: Approximation algorithms for car-sharing problems. In: Kim, D., Uma, R.N., Cai, Z., Lee, D.H. (eds.) COCOON 2020. LNCS, vol. 12273, pp. 262\u2013273. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58150-3_21"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Nayyar, K., Raghvendra, S.: An input sensitive online algorithm for the metric bipartite matching problem. In: Umans, C. (ed.) 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017, Berkeley, CA, USA, 15\u201317 October 2017, pp. 505\u2013515. IEEE Computer Society (2017)","DOI":"10.1109\/FOCS.2017.53"},{"issue":"2","key":"18_CR13","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1287\/ijoc.1030.0052","volume":"16","author":"W de Paepe","year":"2004","unstructured":"de Paepe, W., Lenstra, J.K., Sgall, J., Sitters, R.A., Stougie, L.: Computer-aided complexity classification of dial-a-ride problems. INFORMS J. Comput. 16(2), 120\u2013132 (2004)","journal-title":"INFORMS J. Comput."},{"key":"18_CR14","unstructured":"Raghvendra, S.: A robust and optimal online algorithm for minimum metric bipartite matching. In: Jansen, K., Mathieu, C., Rolim, J.D.P., Umans, C. (eds.) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX\/RANDOM 2016, 7\u20139 September 2016, Paris, France. LIPIcs, vol. 60, pp. 18:1\u201318:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016)"},{"issue":"2","key":"18_CR15","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1109\/TKDE.2017.2760880","volume":"30","author":"N Ta","year":"2017","unstructured":"Ta, N., Li, G., Zhao, T., Feng, J., Ma, H., Gong, Z.: An efficient ride-sharing framework for maximizing shared route. IEEE Trans. Knowl. Data Eng. 30(2), 219\u2013233 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"11","key":"18_CR16","doi-asserted-by":"publisher","first-page":"1633","DOI":"10.14778\/3236187.3236211","volume":"11","author":"Y Tong","year":"2018","unstructured":"Tong, Y., Zeng, Y., Zhou, Z., Chen, L., Ye, J., Xu, K.: A unified approach to route planning for shared mobility. Proc. VLDB Endowment 11(11), 1633 (2018)","journal-title":"Proc. VLDB Endowment"},{"key":"18_CR17","unstructured":"Uber: How uberpool works (2021). https:\/\/www.uber.com\/nl\/en\/ride\/uberpool\/"},{"issue":"3","key":"18_CR18","doi-asserted-by":"publisher","first-page":"320","DOI":"10.14778\/3368289.3368297","volume":"13","author":"Y Zeng","year":"2019","unstructured":"Zeng, Y., Tong, Y., Chen, L.: Last-mile delivery made practical: an efficient route planning framework with theoretical guarantees. Proc. VLDB Endowment 13(3), 320\u2013333 (2019)","journal-title":"Proc. VLDB Endowment"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-95018-7_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T19:23:40Z","timestamp":1726514620000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-95018-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030950170","9783030950187"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-95018-7_18","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":"24 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Puducherry","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"10 February 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 February 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.acsdm.org\/caldam\/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":"Springer OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"80","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":"25","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":"31% - 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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Conference was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}