The following pages link to Sorting by bounded block-moves (Q1281770):
Displayed 17 items.
- A \((1+\varepsilon)\)-approximation algorithm for sorting by short block-moves (Q441865) (← links)
- Tighter upper bound for sorting permutations with prefix transpositions (Q497672) (← links)
- A 14/11-approximation algorithm for sorting by short block-moves (Q543206) (← links)
- Interchange rearrangement: the element-cost model (Q732021) (← links)
- Bounding prefix transposition distance for strings and permutations (Q764373) (← links)
- A review of metrics on permutations for search landscape analysis (Q878593) (← links)
- A quadratic time 2-approximation algorithm for block sorting (Q1006043) (← links)
- Diameter bounds and recursive properties of Full-Flag Johnson graphs (Q1752664) (← links)
- Approximation algorithms for sorting by bounded singleton moves (Q2143142) (← links)
- Sorting on graphs by adjacent swaps using permutation groups (Q2374257) (← links)
- On sorting by 3-bounded transpositions (Q2497524) (← links)
- An Audit Tool for Genome Rearrangement Algorithms (Q2828184) (← links)
- An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves (Q2942654) (← links)
- CIRCULAR INVERSIONS OF PERMUTATIONS AND THEIR USE IN SORTING PROBLEMS (Q5150721) (← links)
- APPROXIMATE BLOCK SORTING (Q5291300) (← links)
- Block Sorting is Hard (Q5696919) (← links)
- A new upper bound for sorting permutations with prefix transpositions (Q5859487) (← links)