The following pages link to Sorting by short block-moves (Q1587783):
Displaying 12 items.
- A \((1+\varepsilon)\)-approximation algorithm for sorting by short block-moves (Q441865) (← links)
- A 14/11-approximation algorithm for sorting by short block-moves (Q543206) (← links)
- A review of metrics on permutations for search landscape analysis (Q878593) (← links)
- A quadratic time 2-approximation algorithm for block sorting (Q1006043) (← links)
- Sorting by bounded block-moves (Q1281770) (← links)
- Sorting a permutation by best short swaps (Q2037101) (← links)
- Approximation algorithms for sorting by bounded singleton moves (Q2143142) (← links)
- On sorting by 3-bounded transpositions (Q2497524) (← links)
- An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves (Q2942654) (← links)
- On Sorting by 3-Bounded Transpositions (Q3439056) (← links)
- APPROXIMATE BLOCK SORTING (Q5291300) (← links)
- Block Sorting is Hard (Q5696919) (← links)
