New approximations for block sorting

Authors

J. Huang, University of North Florida
S. Roy, University of North FloridaFollow
A. Asaithambi, University of North FloridaFollow

Document Type

Article

Publication Date

12-1-2016

Abstract

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.

Publication Title

Network Modeling Analysis in Health Informatics and Bioinformatics

Volume

5

Issue

1

Digital Object Identifier (DOI)

10.1007/s13721-016-0113-x

ISSN

21926662

E-ISSN

21926670

Citation Information

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