TY - GEN
T1 - An improved competitive algorithm for reordering buffer management
AU - Avigdor-Elgrabli, Noa
AU - Rabani, Yuval
PY - 2010
Y1 - 2010
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=77951682141&partnerID=8YFLogxK
U2 - 10.1137/1.9781611973075.2
DO - 10.1137/1.9781611973075.2
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:77951682141
SN - 9780898717013
T3 - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
SP - 13
EP - 21
BT - Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms
PB - Association for Computing Machinery (ACM)
T2 - 21st Annual ACM-SIAM Symposium on Discrete Algorithms
Y2 - 17 January 2010 through 19 January 2010
ER -