Pages that link to "Item:Q2235751"
From MaRDI portal
The following pages link to Approximation algorithms for sorting permutations by extreme block-interchanges (Q2235751):
Displaying 8 items.
- Sorting permutations by block-interchanges (Q673336) (← links)
- An improved algorithm for sorting by block-interchanges based on permutation groups (Q991802) (← links)
- A quadratic time 2-approximation algorithm for block sorting (Q1006043) (← links)
- Approximation algorithms for sorting permutations by fragmentation-weighted operations (Q1660115) (← 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)
- Sorting by prefix block-interchanges (Q6038693) (← links)