TY - JOUR
T1 - An improved competitive algorithm for reordering buffer management
AU - Avigdor-Elgrabli, Noa
AU - Rabani, Yuval
PY - 2015/6/1
Y1 - 2015/6/1
N2 - We design and analyze an online reordering buffer management algorithm with improved O(logk/loglogk) competitive ratio for nonuniform costs, where k is the buffer size. This improves on the best previous result (even for uniform costs) of Englert and Westermann (2005) giving O(log k) competitive ratio, which was also the best (offline) 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 article.
AB - We design and analyze an online reordering buffer management algorithm with improved O(logk/loglogk) competitive ratio for nonuniform costs, where k is the buffer size. This improves on the best previous result (even for uniform costs) of Englert and Westermann (2005) giving O(log k) competitive ratio, which was also the best (offline) 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 article.
KW - Online computing
KW - Reordering buffer management
UR - http://www.scopus.com/inward/record.url?scp=84932651472&partnerID=8YFLogxK
U2 - 10.1145/2663347
DO - 10.1145/2663347
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:84932651472
SN - 1549-6325
VL - 11
JO - ACM Transactions on Algorithms
JF - ACM Transactions on Algorithms
IS - 4
M1 - 35
ER -