The MIN cache replacement algorithm is an optimal off-line policy to decide which item to evict when a new item should be fetched into a cache. Recently, two short proofs were given by van Roy (2007)  and Vogler (2008) . We provide a simpler proof based on a novel invariant condition maintained through an incremental procedure.
- Analysis of algorithms
- MIN algorithm