Pages that link to "Item:Q441865"
From MaRDI portal
The following pages link to A \((1+\varepsilon)\)-approximation algorithm for sorting by short block-moves (Q441865):
Displaying 9 items.
- A 14/11-approximation algorithm for sorting by short block-moves (Q543206) (← links)
- A quadratic time 2-approximation algorithm for block sorting (Q1006043) (← links)
- Sorting by bounded block-moves (Q1281770) (← links)
- Sorting by short block-moves (Q1587783) (← links)
- Length-weighted \(\lambda\)-rearrangement distance (Q2025054) (← links)
- Sorting a permutation by best short swaps (Q2037101) (← links)
- Approximation algorithms for sorting permutations by length-weighted short rearrangements (Q2132329) (← links)
- An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves (Q2942654) (← links)
- Block Sorting Is APX-Hard (Q2947036) (← links)