{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:18:55Z","timestamp":1740169135370,"version":"3.37.3"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U11811463"],"award-info":[{"award-number":["U11811463"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100009592","name":"Beijing Municipal Science and Technology Commission","doi-asserted-by":"publisher","award":["Z191100002519012"],"award-info":[{"award-number":["Z191100002519012"]}],"id":[{"id":"10.13039\/501100009592","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.2982423","type":"journal-article","created":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T02:25:49Z","timestamp":1585016749000},"page":"57772-57785","source":"Crossref","is-referenced-by-count":1,"title":["Spatial Two-Sided Online Bottleneck Matching With Deadlines"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7893-3415","authenticated-orcid":false,"given":"Long","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0227-0891","authenticated-orcid":false,"given":"Weifeng","family":"Lv","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23719-5_39"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/2424321.2424346"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-12691-3_30"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-012-9581-9"},{"journal-title":"A better lower bound for on-line bottleneck matching","year":"1992","author":"idury","key":"ref31"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465321"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973105.7"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1993.1026"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100262"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-015-9948-9"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-18590-9_51"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/335191.335388"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00131"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00037"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/UIC-ATC-ScalCom.2014.68"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10707-019-00359-w"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33012245"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2948863"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.14778\/3236187.3236211"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"320","DOI":"10.14778\/3368289.3368297","article-title":"Last-mile delivery made practical: An efficient route planning framework with theoretical guarantees","volume":"13","author":"zeng","year":"2019","journal-title":"Proc VLDB Endowment"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s41019-017-0037-1"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/BF02252026"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137643"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972238"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/2525314.2525346"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.147"},{"journal-title":"The Bottleneck Assignment Problem","year":"1959","author":"gross","key":"ref29"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498228"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91458-9_18"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2729713"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.14778\/3137765.3137827"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.14778\/2994509.2994523"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00568-7"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188858"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3328526.3329573"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.178"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1038\/srep02983"},{"journal-title":"A Production Line Assignment Problem","year":"1953","author":"fulkerson","key":"ref24"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1220433110"},{"key":"ref23","article-title":"Maximizing efficiency in dynamic matching markets","author":"ashlagi","year":"2018","journal-title":"arXiv 1803 01285"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1287\/opre.19.7.1747"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(88)90031-4"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09044201.pdf?arnumber=9044201","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T15:57:10Z","timestamp":1642003030000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9044201\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":42,"URL":"https:\/\/doi.org\/10.1109\/access.2020.2982423","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2020]]}}}