{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:51:51Z","timestamp":1750308711898,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,1,9]],"date-time":"2013-01-09T00:00:00Z","timestamp":1357689600000},"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":[],"published-print":{"date-parts":[[2013,1,9]]},"DOI":"10.1145\/2422436.2422489","type":"proceedings-article","created":{"date-parts":[[2013,1,3]],"date-time":"2013-01-03T12:58:22Z","timestamp":1357217902000},"page":"485-494","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Catch them if you can"],"prefix":"10.1145","author":[{"given":"Marek","family":"Cygan","sequence":"first","affiliation":[{"name":"University of Warsaw, Warszawa, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthias","family":"Englert","sequence":"additional","affiliation":[{"name":"University of Warwick, Coventry, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anupam","family":"Gupta","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcin","family":"Mucha","sequence":"additional","affiliation":[{"name":"University of Warsaw, Warszawa, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piotr","family":"Sankowski","sequence":"additional","affiliation":[{"name":"University of Warsaw, Warszawa, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,1,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133131"},{"key":"e_1_3_2_1_2_1","volume-title":"On Queues with Impatient Customers. Rapports de recherche","author":"Baccelli F.","year":"1981","unstructured":"F. Baccelli and G. H\u00e9buterne . On Queues with Impatient Customers. Rapports de recherche . Institut national de recherche en informatique et en automatique , 1981 . F. Baccelli and G. H\u00e9buterne. On Queues with Impatient Customers. Rapports de recherche. Institut national de recherche en informatique et en automatique, 1981."},{"key":"e_1_3_2_1_3_1","series-title":"Springer Series in Operations Research","volume-title":"Introduction to stochastic programming","author":"Birge J. R.","year":"1997","unstructured":"J. R. Birge and F. Louveaux . Introduction to stochastic programming . Springer Series in Operations Research . Springer-Verlag , New York , 1997 . J. R. Birge and F. Louveaux. Introduction to stochastic programming. Springer Series in Operations Research. Springer-Verlag, New York, 1997."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02927-1_23"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2005.03.005"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-003-1025-6"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1080.0330"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1002\/nav.10092"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2010.v006a011"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.72"},{"key":"e_1_3_2_1_11_1","first-page":"684","volume-title":"15th SODA","author":"Immorlica N.","year":"2004","unstructured":"N. Immorlica , D. Karger , M. Minkoff , and V. Mirrokni . On the costs and benefits of procrastination: Approximation algorithms for stochastic combinatorial optimization problems . In 15th SODA , pages 684 -- 693 , 2004 . N. Immorlica, D. Karger, M. Minkoff, and V. Mirrokni. On the costs and benefits of procrastination: Approximation algorithms for stochastic combinatorial optimization problems. In 15th SODA, pages 684--693, 2004."},{"key":"e_1_3_2_1_12_1","first-page":"239","volume-title":"ESA","year":"2011","unstructured":"\u0141. Jez. One to rule them all: A general randomized algorithm for buffer management with bounded delay . In ESA , pages 239 -- 250 , 2011 . \u0141. Jez. One to rule them all: A general randomized algorithm for buffer management with bounded delay. In ESA, pages 239--250, 2011."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993715"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100262"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993716"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-25960-2_8"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1217856.1217860"},{"key":"e_1_3_2_1_18_1","unstructured":"S. Zeltyn and A. Mandelbaum. Call centers with impatient customers: Many-server asymptotics of the m\/m\/i  S. Zeltyn and A. Mandelbaum. Call centers with impatient customers: Many-server asymptotics of the m\/m\/i"},{"volume-title":"Queueing Systems, 51:361--402","year":"2005","key":"e_1_3_2_1_19_1","unstructured":"g queue. Queueing Systems, 51:361--402 , 2005 . 10.1007\/s11134-005--3699--8. g queue. Queueing Systems, 51:361--402, 2005. 10.1007\/s11134-005--3699--8."}],"event":{"name":"ITCS '13: Innovations in Theoretical Computer Science","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Berkeley California USA","acronym":"ITCS '13"},"container-title":["Proceedings of the 4th conference on Innovations in Theoretical Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2422436.2422489","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2422436.2422489","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:14:15Z","timestamp":1750277655000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2422436.2422489"}},"subtitle":["how to serve impatient users"],"short-title":[],"issued":{"date-parts":[[2013,1,9]]},"references-count":19,"alternative-id":["10.1145\/2422436.2422489","10.1145\/2422436"],"URL":"https:\/\/doi.org\/10.1145\/2422436.2422489","relation":{},"subject":[],"published":{"date-parts":[[2013,1,9]]},"assertion":[{"value":"2013-01-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}