Abstract

AbstractBlock 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 \(\mathcal{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.KeywordsDesign and analysis of algorithmsapproximation algori- thmsblock sortingtransposition sortingoptical character recognition

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call