New approximations for block sorting

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

Share

COinS
 

Accessibility Statement

This item was created or digitized before April 24, 2027, or is a reproduction of legacy material created before that date. It is preserved in its original, unmodified state specifically for research, reference, or historical recordkeeping. In accordance with the ADA Title II Final Rule, the Library provides accessible versions of archival materials by request. If you are experiencing difficulty accessing the information on the site due to a disability, please submit a request through the following form for assistance.