A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
A Constant Factor Approximation Algorithm for Reordering Buffer Management
[chapter]

2013
*
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms
*

In the reordering buffer management problem (RBM) a sequence of n colored items enters a buffer with limited capacity k. When the buffer is full, one item is removed to the output sequence, making room for the next input item. This step is repeated until the input sequence is exhausted and the buffer is empty. The objective is to find a sequence of removals that minimizes the total number of color changes in the output sequence. The problem formalizes numerous applications in computer and

doi:10.1137/1.9781611973105.70
dblp:conf/soda/Avigdor-ElgrabliR13
fatcat:zlbjmhha7vh2tfr7ljllcyll6a