Pages that link to "Item:Q1400064"
From MaRDI portal
The following pages link to A new approximation algorithm for sorting of signed permutations (Q1400064):
Displaying 8 items.
- A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations (Q439973) (← links)
- Approximation algorithms for sorting permutations by fragmentation-weighted operations (Q1660115) (← links)
- Heuristics for the sorting signed permutations by reversals and transpositions problem (Q1660118) (← links)
- A new approximation algorithm for unsigned translocation sorting (Q1708438) (← links)
- Approximation algorithms for sorting by \(k\)-cuts on signed permutations (Q2099384) (← links)
- Approximation algorithms for sorting permutations by length-weighted short rearrangements (Q2132329) (← links)
- Sorting by \(k\)-cuts on signed permutations (Q2163961) (← links)
- Transforming cabbage into turnip (Q3158530) (← links)