{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T21:29:54Z","timestamp":1765142994264},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2013,1]]},"DOI":"10.1007\/s00453-011-9574-6","type":"journal-article","created":{"date-parts":[[2011,10,3]],"date-time":"2011-10-03T14:46:19Z","timestamp":1317653179000},"page":"60-94","source":"Crossref","is-referenced-by-count":5,"title":["Collecting Weighted Items from a Dynamic Queue"],"prefix":"10.1007","volume":"65","author":[{"given":"Marcin","family":"Bienkowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marek","family":"Chrobak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christoph","family":"D\u00fcrr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mathilde","family":"Hurand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Artur","family":"Je\u017c","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u0141ukasz","family":"Je\u017c","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grzegorz","family":"Stachowiak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,10,4]]},"reference":[{"key":"9574_CR1","first-page":"761","volume-title":"Proceedings of the 14th Symposium on Discrete Algorithms (SODA)","author":"N. Andelman","year":"2003","unstructured":"Andelman, N., Mansour, Y., Zhu, A.: Competitive queueing policies in QoS switches. In: Proceedings of the 14th Symposium on Discrete Algorithms (SODA), pp. 761\u2013770. ACM\/SIAM, New York (2003)"},{"issue":"1","key":"9574_CR2","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1145\/1360443.1360462","volume":"39","author":"B. Birnbaum","year":"2008","unstructured":"Birnbaum, B., Mathieu, C.: On-line bipartite matching made simple. SIGACT News 39(1), 80\u201387 (2008)","journal-title":"SIGACT News"},{"key":"9574_CR3","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/j.jda.2005.03.005","volume":"4","author":"F.Y.L. Chin","year":"2006","unstructured":"Chin, F.Y.L., Chrobak, M., Fung, S.P.Y., Jawor, W., Sgall, J., Tich\u00fd, T.: Online competitive algorithms for maximizing weighted throughput of unit jobs. J. Discrete Algorithms 4, 255\u2013276 (2006)","journal-title":"J. Discrete Algorithms"},{"key":"9574_CR4","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s00453-003-1025-6","volume":"37","author":"F.Y.L. Chin","year":"2003","unstructured":"Chin, F.Y.L., Fung, S.P.Y.: Online scheduling for partial job values: Does timesharing or randomization help? Algorithmica 37, 149\u2013164 (2003)","journal-title":"Algorithmica"},{"key":"9574_CR5","first-page":"209","volume-title":"Proceedings of the 18th Symposium on Discrete Algorithms (SODA)","author":"M. Englert","year":"2007","unstructured":"Englert, M., Westermann, M.: Considering suppressed packets improves buffer management in QoS switches. In: Proceedings of the 18th Symposium on Discrete Algorithms (SODA), pp. 209\u2013218. ACM\/SIAM, New York (2007)"},{"key":"9574_CR6","first-page":"434","volume-title":"Conference on Information Sciences and Systems","author":"B. Hajek","year":"2001","unstructured":"Hajek, B.: On the competitiveness of online scheduling of unit-length packets with hard deadlines in slotted time. In: Conference on Information Sciences and Systems, pp. 434\u2013438 (2001)"},{"key":"9574_CR7","first-page":"239","volume-title":"Proceedings of the 19th Annual European Symposium on Algorithms (ESA)","author":"\u0141. Je\u017c","year":"2011","unstructured":"Je\u017c, \u0141.: One to rule them all: A general randomized algorithm for buffer management with bounded delay. In: Proceedings of the 19th Annual European Symposium on Algorithms (ESA), pp. 239\u2013250 (2011)"},{"issue":"1\u20132","key":"9574_CR8","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/S0304-3975(99)00140-1","volume":"233","author":"B. Kalyanasundaram","year":"2000","unstructured":"Kalyanasundaram, B., Pruhs, K.: An optimal deterministic algorithm for online b-matching. Theor. Comput. Sci. 233(1\u20132), 319\u2013325 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"9574_CR9","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1137\/S0097539701399666","volume":"33","author":"A. Kesselman","year":"2004","unstructured":"Kesselman, A., Lotker, Z., Mansour, Y., Patt-Shamir, B., Schieber, B., Sviridenko, M.: Buffer overflow management in QoS switches. SIAM J. Comput. 33, 563\u2013583 (2004)","journal-title":"SIAM J. Comput."},{"key":"9574_CR10","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s00453-005-1158-x","volume":"43","author":"A. Kesselman","year":"2005","unstructured":"Kesselman, A., Mansour, Y., van Stee, R.: Improved competitive guarantees for QoS buffering. Algorithmica 43, 63\u201380 (2005)","journal-title":"Algorithmica"},{"key":"9574_CR11","first-page":"801","volume-title":"Proceedings of the 16th Symposium on Discrete Algorithms (SODA)","author":"F. Li","year":"2005","unstructured":"Li, F., Sethuraman, J., Stein, C.: An optimal online algorithm for packet scheduling with agreeable deadlines. In: Proceedings of the 16th Symposium on Discrete Algorithms (SODA), pp. 801\u2013802. ACM\/SIAM, New York (2005)"},{"key":"9574_CR12","first-page":"199","volume-title":"Proceedings of the 18th Symposium on Discrete Algorithms (SODA)","author":"F. Li","year":"2007","unstructured":"Li, F., Sethuraman, J., Stein, C.: Better online buffer management. In: Proceedings of the 18th Symposium on Discrete Algorithms (SODA), pp. 199\u2013208. ACM\/SIAM, New York (2007)"},{"issue":"5","key":"9574_CR13","volume":"54","author":"A. Mehta","year":"2007","unstructured":"Mehta, A., Saberi, A., Vazirani, U.V., Vazirani, V.V.: Adwords and generalized online matching. J.\u00a0ACM 54(5), 22 (2007)","journal-title":"J.\u00a0ACM"},{"key":"9574_CR14","unstructured":"Meteor burst communications. http:\/\/en.wikipedia.org\/wiki\/Meteor_burst"},{"key":"9574_CR15","unstructured":"WiMAX. http:\/\/en.wikipedia.org\/wiki\/WiMAX"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/s00453-011-9574-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T07:21:34Z","timestamp":1497943294000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-011-9574-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10,4]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,1]]}},"alternative-id":["9574"],"URL":"https:\/\/doi.org\/10.1007\/s00453-011-9574-6","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,10,4]]}}}