Pages that link to "Item:Q2099384"
From MaRDI portal
The following pages link to Approximation algorithms for sorting by \(k\)-cuts on signed permutations (Q2099384):
Displaying 5 items.
- A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations (Q439973) (← links)
- Sorting by multi-cut rearrangements (Q831850) (← links)
- Approximation algorithms for sorting permutations by fragmentation-weighted operations (Q1660115) (← links)
- Sorting by \(k\)-cuts on signed permutations (Q2163961) (← links)
- On sorting unsigned permutations by double-cut-and-joins (Q2377380) (← links)