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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Network Modeling Analysis in Health Informatics and Bioinformatics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.