A Faster and Simpler 2-Approximation Algorithm for Block Sorting

摘要

Block sorting is used in connection with optical character recognition (OCR). Recent work has focused on finding good strategies which perform well in practice. Block sorting is NP-hard and all of the previously known heuristics lack proof of any approximation ratio. We present here an approximation algorithm for the block sorting problem with approximation ratio of 2 and run time O(n~2). The approximation algorithm is based on finding an optimal sequence of absolute block deletions.