{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:17:16Z","timestamp":1759637836088,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319587462"},{"type":"electronic","value":"9783319587479"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-58747-9_19","type":"book-chapter","created":{"date-parts":[[2017,5,5]],"date-time":"2017-05-05T01:14:05Z","timestamp":1493946845000},"page":"206-216","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Approximation Algorithms for the Maximum Carpool Matching Problem"],"prefix":"10.1007","author":[{"given":"Gilad","family":"Kutiel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,6]]},"reference":[{"key":"19_CR1","unstructured":"Zimride by enterprise. https:\/\/zimride.com\/"},{"issue":"2","key":"19_CR2","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.ejor.2012.05.028","volume":"223","author":"N Agatz","year":"2012","unstructured":"Agatz, N., Erera, A., Savelsbergh, M., Wang, X.: Optimization for dynamic ride-sharing: A review. Eur. J. Oper. Res. 223(2), 295\u2013303 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"19_CR3","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s00453-004-1087-0","volume":"39","author":"EM Arkin","year":"2004","unstructured":"Arkin, E.M., Hassin, R., Rubinstein, S., Sviridenko, M.: Approximations for maximum transportation with permutable supply vector and other capacitated star packing problems. Algorithmica 39(2), 175\u2013187 (2004)","journal-title":"Algorithmica"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-540-74208-1_4","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"N Chen","year":"2007","unstructured":"Chen, N., Engelberg, R., Nguyen, C.T., Raghavendra, P., Rudra, A., Singh, G.: Improved approximation algorithms for the spanning star forest problem. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) APPROX\/RANDOM -2007. LNCS, vol. 4627, pp. 44\u201358. Springer, Heidelberg (2007). doi:10.1007\/978-3-540-74208-1_4"},{"key":"19_CR5","unstructured":"Hartman, I.B.-A.: Optimal assignment for carpooling-draft. Draft (2013)"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/j.procs.2014.05.433","volume":"32","author":"IB-A Hartman","year":"2014","unstructured":"Hartman, I.B.-A., Keren, D., Dbai, A.A., Cohen, E., Knapen, L., Janssens, D., et al.: Theory and practice in large carpooling problems. Procedia Comput. Sci. 32, 339\u2013347 (2014)","journal-title":"Procedia Comput. Sci."},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1016\/j.procs.2013.06.051","volume":"19","author":"L Knapen","year":"2013","unstructured":"Knapen, L., Keren, D., Cho, S., Bellemans, T., Janssens, D., Wets, G., et al.: Estimating scalability issues while finding an optimal assignment for carpooling. Procedia Comput. Sci. 19, 372\u2013379 (2013)","journal-title":"Procedia Comput. Sci."},{"issue":"3","key":"19_CR8","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/s12652-013-0197-4","volume":"5","author":"L Knapen","year":"2014","unstructured":"Knapen, L., Yasar, A., Cho, S., Keren, D., Dbai, A.A., Bellemans, T., Janssens, D., Wets, G., Schuster, A., Sharfman, I., et al.: Exploiting graph-theoretic tools for matching in carpooling applications. J. Ambient Intell. Humaniz. Comput. 5(3), 393\u2013407 (2014)","journal-title":"J. Ambient Intell. Humaniz. Comput."},{"issue":"3","key":"19_CR9","doi-asserted-by":"publisher","first-page":"946","DOI":"10.1137\/070682150","volume":"38","author":"CT Nguyen","year":"2008","unstructured":"Nguyen, C.T., Shen, J., Hou, M., Sheng, L., Miller, W., Zhang, L.: Approximating the spanning star forest problem and its application to genomic sequence alignment. SIAM J. Comput. 38(3), 946\u2013962 (2008)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"19_CR10","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/BF02579369","volume":"5","author":"\u00c9 Tardos","year":"1985","unstructured":"Tardos, \u00c9.: A strongly polynomial minimum cost circulation algorithm. Combinatorica 5(3), 247\u2013255 (1985)","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-58747-9_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T17:15:57Z","timestamp":1710263757000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-58747-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319587462","9783319587479"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-58747-9_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"6 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kazan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 June 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/logic.pdmi.ras.ru\/csr2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}