{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T20:01:38Z","timestamp":1730232098907,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1109\/icc.2018.8422976","type":"proceedings-article","created":{"date-parts":[[2018,8,20]],"date-time":"2018-08-20T22:51:41Z","timestamp":1534805501000},"page":"1-6","source":"Crossref","is-referenced-by-count":14,"title":["Optimizing Carpool Scheduling Algorithm through Partition Merging"],"prefix":"10.1109","author":[{"given":"Yubin","family":"Duan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Turash","family":"Mosharraf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jie","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huanyang","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"88","article-title":"Fast detour computation for ride sharing","volume":"14","author":"geisberger","year":"2010","journal-title":"OASlcs-OpenAccess Series in Informatics"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972870.4"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1403657111"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/SAHCN.2015.7338355"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/IWQoS.2017.7969157"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/UIC-ATC.2017.8397518"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230110211"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/6462.6502"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch50"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.trd.2017.07.031"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s11116-015-9661-7"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ITSC.2016.7795562"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ITSC.2016.7795739"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1030.0106"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/j.procs.2014.05.433","article-title":"Theory and practice in large carpooling problems","volume":"32","author":"hartman","year":"2014","journal-title":"Procedia Computer Science"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1108\/9780080481449"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.enpol.2011.01.043"},{"journal-title":"The carpool problem","year":"1997","author":"buchholz","key":"ref9"}],"event":{"name":"ICC 2018 - 2018 IEEE International Conference on Communications","start":{"date-parts":[[2018,5,20]]},"location":"Kansas City, MO, USA","end":{"date-parts":[[2018,5,24]]}},"container-title":["2018 IEEE International Conference on Communications (ICC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8411665\/8422068\/08422976.pdf?arnumber=8422976","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,3]],"date-time":"2021-06-03T09:49:01Z","timestamp":1622713741000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8422976\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/icc.2018.8422976","relation":{},"subject":[],"published":{"date-parts":[[2018,5]]}}}