{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:32:06Z","timestamp":1758274326939,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662480533"},{"type":"electronic","value":"9783662480540"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-662-48054-0_40","type":"book-chapter","created":{"date-parts":[[2015,8,10]],"date-time":"2015-08-10T11:57:29Z","timestamp":1439207849000},"page":"483-492","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Offline Carpool Problem Revisited"],"prefix":"10.1007","author":[{"given":"Saad","family":"Mneimneh","sequence":"first","affiliation":[]},{"given":"Saman","family":"Farhat","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,11]]},"reference":[{"issue":"2","key":"40_CR1","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1147\/rd.272.0133","volume":"27","author":"R Fagin","year":"1983","unstructured":"Fagin, R., Williams, J.H.: A fair carpool scheduling algorithm. IBM J. Res. Dev. 27(2), 133\u2013139 (1983)","journal-title":"IBM J. Res. Dev."},{"doi-asserted-by":"crossref","unstructured":"Mneimneh, S.: Load balancing in a switch without buffers. In: IEEE Workshop on High Performance Switching and Routing, Poznan (2006)","key":"40_CR2","DOI":"10.1109\/HPSR.2006.1709705"},{"doi-asserted-by":"crossref","unstructured":"Coppersmith, D., Nowicki, T., Paleologo, G., Tresser, C., Wu, C.W.: The optimality of the online greedy algorithm in carpool and chairman assignment problems. ACM Trans. Algorithms, 7(3), Article 37, July 2011","key":"40_CR3","DOI":"10.1145\/1978782.1978792"},{"issue":"2","key":"40_CR4","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1006\/jagm.1998.0953","volume":"29","author":"M Ajtai","year":"1988","unstructured":"Ajtai, M., Aspnes, J., Naor, M., Rabini, Y., Schulman, L.J., Waarts, O.: Fairness in Scheduling. J. Algorithms 29(2), 306\u2013357 (1988)","journal-title":"J. Algorithms"},{"unstructured":"Naor, M.: How to Carpool Fairly. http:\/\/www.wisdom.weizmann.ac.il\/naor\/PAPERS\/carpool_fair.pps","key":"40_CR5"},{"issue":"1","key":"40_CR6","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.jalgor.2004.05.001","volume":"55","author":"M Naor","year":"2005","unstructured":"Naor, M.: On fairness in the carpool problem. J. Algorithms 55(1), 93\u201398 (2005)","journal-title":"J. Algorithms"},{"unstructured":"Williamson, D.: Lecture Notes on Network Flows, Chapter 3. http:\/\/people.orie.cornell.edu\/dpw\/techreports\/cornell-flow.pdf","key":"40_CR7"},{"unstructured":"Havet, F.: Combinatorial Optimization, Chapter 11 on Fractional Relaxation. http:\/\/www-sop.inria.fr\/members\/Frederic.Havet\/","key":"40_CR8"},{"unstructured":"Boavida, J.B., Kamat, V., Nakum, D., Nong, R., Wu, C.W., Zhang, X.: Algorithms for the Carpool Problem. http:\/\/www.ima.umn.edu\/2005-2006\/MM8.9-18.06\/activities\/Wu-Chai\/team6_rep.pdf","key":"40_CR9"},{"key":"40_CR10","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/0012-365X(80)90269-1","volume":"32","author":"R Tijdeman","year":"1980","unstructured":"Tijdeman, R.: The chairman assignment problem. Discrete Math. 32, 323\u2013330 (1980)","journal-title":"Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2015"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48054-0_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T17:58:30Z","timestamp":1675274310000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-48054-0_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662480533","9783662480540"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48054-0_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"11 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}