{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:19:27Z","timestamp":1759637967861,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T00:00:00Z","timestamp":1561248000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100011199","name":"European Research Council","doi-asserted-by":"publisher","award":["321171"],"award-info":[{"award-number":["321171"]}],"id":[{"id":"10.13039\/100011199","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["1652110"],"award-info":[{"award-number":["1652110"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,23]]},"DOI":"10.1145\/3313276.3316370","type":"proceedings-article","created":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T12:19:08Z","timestamp":1561033148000},"page":"1136-1147","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["The online \ud835\udc58-taxi problem"],"prefix":"10.1145","author":[{"given":"Christian","family":"Coester","sequence":"first","affiliation":[{"name":"University of Oxford, UK"}]},{"given":"Elias","family":"Koutsoupias","sequence":"additional","affiliation":[{"name":"University of Oxford, UK"}]}],"member":"320","published-online":{"date-parts":[[2019,6,23]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Nikhil Bansal Niv Buchbinder Aleksander Madry and Joseph Naor. 2011.  Nikhil Bansal Niv Buchbinder Aleksander Madry and Joseph Naor. 2011."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.63"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/3039686.3039751"},{"key":"e_1_3_2_1_4_1","unstructured":"Nikhil Bansal Marek Eli\u00e1s Lukasz Jez Grigorios Koumoutsos and Kirk Pruhs. 2018.  Nikhil Bansal Marek Eli\u00e1s Lukasz Jez Grigorios Koumoutsos and Kirk Pruhs. 2018."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Tight Bounds for Double Coverage Against Weak Adversaries. Theory Comput. Syst. 62 2 (2018) 349\u2013365. 016- 9703- 3  Tight Bounds for Double Coverage Against Weak Adversaries. Theory Comput. Syst. 62 2 (2018) 349\u2013365. 016- 9703- 3","DOI":"10.1007\/s00224-016-9703-3"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.52"},{"key":"e_1_3_2_1_7_1","unstructured":"Yair Bartal. 1996.  Yair Bartal. 1996."},{"volume-title":"In 37th Annual Symposium on Foundations of Computer Science (FOCS \u201996)","author":"Metric Probabilistic Approximation","key":"e_1_3_2_1_8_1"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01294260"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188798"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0024"},{"key":"e_1_3_2_1_12_1","unstructured":"0024  0024"},{"key":"e_1_3_2_1_13_1","unstructured":"Marek Chrobak Howard Karloff Tom Payne and Sundar Vishwanathan. 1991.  Marek Chrobak Howard Karloff Tom Payne and Sundar Vishwanathan. 1991."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/0404017"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/0220008"},{"key":"e_1_3_2_1_16_1","unstructured":"Christian Coester and Elias Koutsoupias. 2018. The Online k-Taxi Problem. CoRR abs\/1807.06645 (2018). arXiv: 1807.06645  Christian Coester and Elias Koutsoupias. 2018. The Online k-Taxi Problem. CoRR abs\/1807.06645 (2018). arXiv: 1807.06645"},{"volume-title":"44th International Colloquium on Automata, Languages, and Programming (ICALP","year":"2017","author":"Coester Christian","key":"e_1_3_2_1_17_1"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/174130.174131"},{"volume-title":"44th International Colloquium on Automata, Languages, and Programming (ICALP","year":"2017","author":"Dehghani Sina","key":"e_1_3_2_1_19_1"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780608"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795279943"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/FSCS.1990.89566"},{"key":"e_1_3_2_1_23_1","unstructured":"Andrew P. Kosoresow. 1996.  Andrew P. Kosoresow. 1996."},{"key":"e_1_3_2_1_24_1","unstructured":"Design and analysis of online algorithms for mobile server applications. Ph.D. Dissertation. Stanford University.  Design and analysis of online algorithms for mobile server applications. Ph.D. Dissertation. Stanford University."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2009.04.002"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/210118.210128"},{"key":"e_1_3_2_1_27_1","unstructured":"James R. Lee. 2018.  James R. Lee. 2018."},{"volume-title":"Proceedings of the 59th Annual IEEE Symposium on Foundations of Computer Science (FOCS \u201918)","author":"Fusible","key":"e_1_3_2_1_28_1"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62243"},{"key":"e_1_3_2_1_30_1","unstructured":"62243  62243"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(91)90263-2"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.386.0683"}],"event":{"name":"STOC '19: 51st Annual ACM SIGACT Symposium on the Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Phoenix AZ USA","acronym":"STOC '19"},"container-title":["Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3313276.3316370","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3313276.3316370","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:54:32Z","timestamp":1750204472000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3313276.3316370"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,23]]},"references-count":32,"alternative-id":["10.1145\/3313276.3316370","10.1145\/3313276"],"URL":"https:\/\/doi.org\/10.1145\/3313276.3316370","relation":{},"subject":[],"published":{"date-parts":[[2019,6,23]]},"assertion":[{"value":"2019-06-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}