{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:09:11Z","timestamp":1750306151187,"version":"3.41.0"},"reference-count":4,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2016,6,3]],"date-time":"2016-06-03T00:00:00Z","timestamp":1464912000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGACT News"],"published-print":{"date-parts":[[2016,6,3]]},"DOI":"10.1145\/2951860.2951871","type":"journal-article","created":{"date-parts":[[2016,6,10]],"date-time":"2016-06-10T13:00:33Z","timestamp":1465563633000},"page":"40-51","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["SIGACT News Online Algorithms Column 28"],"prefix":"10.1145","volume":"47","author":[{"given":"Rob","family":"van Stee","sequence":"first","affiliation":[{"name":"University of Leicester, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2016,6,3]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Antonios\n       \n      Antoniadis Neal\n       \n      Barcelo Michael\n       \n      Nugent Kirk\n       \n      Pruhs and \n      \n      \n      Michele\n       \n      Scquizzato\n    .\n      \n  \n   \n  A o(n) -competitive deterministic algorithm for online matching on a line. In Evripidis Bampis and Ola Svensson editors Approximation and Online Algorithms - 12th International Workshop WAOA\n   \n  2014 Wroc law Poland September 11-12 2014 Revised Selected Papers volume \n  8952\n   of \n  Lecture Notes in Computer Science pages \n  11\n  --\n  22\n  . \n  Springer 2014.  Antonios Antoniadis Neal Barcelo Michael Nugent Kirk Pruhs and Michele Scquizzato. A o(n) -competitive deterministic algorithm for online matching on a line. In Evripidis Bampis and Ola Svensson editors Approximation and Online Algorithms - 12th International Workshop WAOA 2014 Wroc law Poland September 11-12 2014 Revised Selected Papers volume 8952 of Lecture Notes in Computer Science pages 11--22. Springer 2014."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.10.028"},{"key":"e_1_2_1_3_1","unstructured":"Elias\n       \n      Koutsoupias\n     and \n      \n      \n      Akash\n       \n      Nanavati\n    .\n      \n  \n   \n  The online matching problem on a line. In Klaus Jansen and Roberto Solis-Oba editors Approximation and Online Algorithms First International Workshop WAOA\n   \n  2003 Budapest Hungary September 16-18 2003 Revised Papers volume \n  2909\n   of \n  Lecture Notes in Computer Science pages \n  179\n  --\n  191\n  . \n  Springer 2003.  Elias Koutsoupias and Akash Nanavati. The online matching problem on a line. In Klaus Jansen and Roberto Solis-Oba editors Approximation and Online Algorithms First International Workshop WAOA 2003 Budapest Hungary September 16-18 2003 Revised Papers volume 2909 of Lecture Notes in Computer Science pages 179--191. Springer 2003."},{"volume-title":"University of California","year":"2004","author":"Nanavati Akash","key":"e_1_2_1_4_1"}],"container-title":["ACM SIGACT News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2951860.2951871","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2951860.2951871","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:39:36Z","timestamp":1750217976000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2951860.2951871"}},"subtitle":["Online Matching on the Line, Part 2"],"short-title":[],"issued":{"date-parts":[[2016,6,3]]},"references-count":4,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,6,3]]}},"alternative-id":["10.1145\/2951860.2951871"],"URL":"https:\/\/doi.org\/10.1145\/2951860.2951871","relation":{},"ISSN":["0163-5700"],"issn-type":[{"type":"print","value":"0163-5700"}],"subject":[],"published":{"date-parts":[[2016,6,3]]},"assertion":[{"value":"2016-06-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}