An improved competitive algorithm for reordering buffer management

Noa Avigdor-Elgrabli*, Yuval Rabani

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

19 Scopus citations

Abstract

We design and analyze an on-line reordering buffer management algorithm with improved O ( log k/log log k) competitive ratio for non-uniform costs, where k is the buffer size. This improves on the best previous result (even for uniform costs) of Englert and Westermann (ICALP 2005) giving O(log k) competitive ratio, which was also the best (off-line) polynomial time approximation guarantee for this problem. Our analysis is based on an intricate dual fitting argument using a linear programming relaxation for the problem that we introduce in this paper.

Original languageAmerican English
Title of host publicationProceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms
PublisherAssociation for Computing Machinery (ACM)
Pages13-21
Number of pages9
ISBN (Print)9780898717013
DOIs
StatePublished - 2010
Event21st Annual ACM-SIAM Symposium on Discrete Algorithms - Austin, TX, United States
Duration: 17 Jan 201019 Jan 2010

Publication series

NameProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Conference

Conference21st Annual ACM-SIAM Symposium on Discrete Algorithms
Country/TerritoryUnited States
CityAustin, TX
Period17/01/1019/01/10

Fingerprint

Dive into the research topics of 'An improved competitive algorithm for reordering buffer management'. Together they form a unique fingerprint.

Cite this