A faster and simpler 2-approximation algorithm for block sorting

Authors:
Wolfgang W. Bein;Lawrence L. Larmore;Linda Morales;I. Hal Sudborough
Affiliations:
School of Computer Science, University of Nevada, Las Vegas, Nevada;School of Computer Science, University of Nevada, Las Vegas, Nevada;Computer Science Department, Texas A&M University-Commerce, Commerce, TX;Department of Computer Science, University of Texas at Dallas, Richardson, TX
Venue:
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Year:
2005

Citing 6
Cited 2

Automated Evaluation of OCR Zoning

IEEE Transactions on Pattern Analysis and Machine Intelligence
On the diameter of the pancake network

Journal of Algorithms
Sorting by reversals is difficult

RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
Sorting by Transpositions

SIAM Journal on Discrete Mathematics
Sorting by bounded block-moves

Discrete Applied Mathematics - Special volume on computational molecular biology DAM-CMB series volume 2
Genome Rearrangements and Sorting by Reversals

SIAM Journal on Computing

A quadratic time 2-approximation algorithm for block sorting

Theoretical Computer Science
Block sorting: a characterization and some heuristics

Nordic Journal of Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 $\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(n2). The approximation algorithm is based on finding an optimal sequence of absolute block deletions.