New approximations for block sorting
We develop, present, and analyze a simple, new 2-approximation algorithm for block sorting in which we use a newly introduced combinatorial structure called an ordered pair. Our algorithm achieves the best known approximation ratio of 2, the tightest known upper bound in terms of the number of block moves needed for block sorting.
Network Modeling Analysis in Health Informatics and Bioinformatics
Digital Object Identifier (DOI)
Huang, Roy, S., & Asaithambi, A. (2016). New approximations for block sorting. Network Modeling and Analysis in Health Informatics and Bioinformatics (Wien), 5(1), 1–5. https://doi.org/10.1007/s13721-016-0113-x