A \(\phi\)-competitive algorithm for collecting items with increasing weights from a dynamic queue

DOI10.1016/j.tcs.2012.12.046zbMath1257.68044OpenAlexW2132894080MaRDI QIDQ1939283

Mathilde Hurand, Grzegorz Stachowiak, Marek Chrobak, Marcin Bienkowski, Christoph Dürr, Artur Jeż, Łukasz Jeż

Publication date: 4 March 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.12.046

zbMATH Keywords

competitive analysisonline algorithmsbuffer managementpacket scheduling

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)

Related Items (2)

A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines ⋮ An optimal algorithm for 2-bounded delay buffer management with lookahead

This page was built for publication: A \(\phi\)-competitive algorithm for collecting items with increasing weights from a dynamic queue