{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T06:03:05Z","timestamp":1780984985299,"version":"3.54.1"},"reference-count":24,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2021,6,14]],"date-time":"2021-06-14T00:00:00Z","timestamp":1623628800000},"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":[[2021,6,14]]},"abstract":"<jats:p>Online packet scheduling with deadlines is one of the fundamental models in buffer management. Recently, the author together with Chrobak, Jez, and Sgall (SODA 2019) designed an optimal \u03d5-competitive algorithm for this problem, where \u03d5 \u22481.618 is the golden ratio. In this column, we sketch ideas that led us to the development of this algorithm and outline the concepts in its analysis. We also highlight open questions in packet scheduling.<\/jats:p>","DOI":"10.1145\/3471469.3471481","type":"journal-article","created":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T22:58:23Z","timestamp":1623970703000},"page":"72-84","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Packet Scheduling"],"prefix":"10.1145","volume":"52","author":[{"given":"Pavel","family":"Vesel\u00fd","sequence":"first","affiliation":[{"name":"Computer Science Institute of Charles University, Prague, Czech Rep"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,6,17]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/2133036.2133131"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/644108.644235"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24749-4_17"},{"issue":"95","key":"e_1_2_1_4_1","first-page":"113","article-title":"Online packet scheduling with bounded delay and lookahead","volume":"776","author":"B\u00a8ohm Martin","year":"2019","journal-title":"Theoretical Computer Science"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.12.046"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-011-9574-6"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.05.015"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2005.03.005"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-003-1025-6"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1290672.1290687"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/2627817.2627824"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/3118767.3119112"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/110856745"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1753171.1753195"},{"key":"e_1_2_1_15_1","first-page":"434","volume-title":"Proc. of the 35th Conference on Information Sciences and Systems","author":"Hajek Bruce","year":"2001"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2390176.2390181"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-005-1158-x"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701399666"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1070432.1070544"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1283383.1283405"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9700-0"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/3310435.3310444"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/3310435.3310444"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.04.007"}],"container-title":["ACM SIGACT News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3471469.3471481","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3471469.3471481","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:26Z","timestamp":1750191446000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3471469.3471481"}},"subtitle":["Plans, Monotonicity, and the Golden Ratio"],"short-title":[],"issued":{"date-parts":[[2021,6,14]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,6,14]]}},"alternative-id":["10.1145\/3471469.3471481"],"URL":"https:\/\/doi.org\/10.1145\/3471469.3471481","relation":{},"ISSN":["0163-5700"],"issn-type":[{"value":"0163-5700","type":"print"}],"subject":[],"published":{"date-parts":[[2021,6,14]]},"assertion":[{"value":"2021-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}