Abstract
We present LP relaxations for uniform and non-uniform reordering buffer management, and their application to the design and analysis of competitive online algorithms and polynomial time approximation algorithms for these problems. The talk is based on several joint papers with Noa Avigdor-Elgrabli, Sungjin Im, and Benjamin Moseley.