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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
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 callMore From: Network Modeling Analysis in Health Informatics and Bioinformatics
Paper Title
Journal
Date
