Algorithms – ESA 2004

DOI10.1007/b100428zbMath1111.68792OpenAlexW2483610301MaRDI QIDQ5464579

Jiří Sgall, Tomas Tichý, Wojciech Jawor, Marek Chrobak

Publication date: 18 August 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b100428

Mathematics Subject Classification ID

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

Related Items (14)

A \(\boldsymbol{\phi }\) -Competitive Algorithm for Scheduling Packets with Deadlines ⋮ Scheduling packets with values and deadlines in size-bounded buffers ⋮ Online competitive algorithms for maximizing weighted throughput of unit jobs ⋮ Comparison-based buffer management in QoS switches ⋮ Buffer management for colored packets with deadlines ⋮ An experimental study of new and known online packet buffering algorithms ⋮ A universal randomized packet scheduling algorithm ⋮ Increasing Machine Speed in On-Line Scheduling of Weighted Unit-Length Jobs in Slotted Time ⋮ Randomized competitive algorithms for online buffer management in the adaptive adversary model ⋮ Randomized Algorithms for Buffer Management with 2-Bounded Delay ⋮ Prompt Mechanisms for Online Auctions ⋮ Improved Online Algorithms for Multiplexing Weighted Packets in Bounded Buffers ⋮ Prompt Mechanism for Online Auctions with Multi-unit Demands ⋮ Prompt mechanism for online auctions with multi-unit demands

This page was built for publication: Algorithms – ESA 2004