Sorting by short block-moves

DOI10.1007/S004530010041zbMATH Open0960.68044OpenAlexW1980815056MaRDI QIDQ1587783FDOQ1587783

Authors: Lenwood S. Heath, John Paul C. Vergara 

Publication date: 3 December 2000

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004530010041

Recommendations

• A \((1+\varepsilon)\)-approximation algorithm for sorting by short block-moves
• An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves
• A 14/11-approximation algorithm for sorting by short block-moves
• APPROXIMATE BLOCK SORTING
• Sorting permutations by block-interchanges

zbMATH Keywords

sorting permutations

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Cited In (17)

• Title not available (Why is that?)
• Computing and Combinatorics
• Sorting by prefix block-interchanges
• APPROXIMATE BLOCK SORTING
• A \((1+\varepsilon)\)-approximation algorithm for sorting by short block-moves
• Approximation algorithms for sorting by bounded singleton moves
• A review of metrics on permutations for search landscape analysis
• Sorting a permutation by best short swaps
• A quadratic time 2-approximation algorithm for block sorting
• Sorting by bounded block-moves
• Block Sorting is Hard
• Sorting a bridge hand
• On Sorting by 3-Bounded Transpositions
• A 14/11-approximation algorithm for sorting by short block-moves
• Short proofs for cut-and-paste sorting of permutations
• An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves
• On sorting by 3-bounded transpositions

This page was built for publication: Sorting by short block-moves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1587783)