Pages that link to "Item:Q2132329"
From MaRDI portal
The following pages link to Approximation algorithms for sorting permutations by length-weighted short rearrangements (Q2132329):
Displaying 7 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)
- Length-weighted \(\lambda\)-rearrangement distance (Q2025054) (← links)
- An 5/4-Approximation Algorithm for Sorting Permutations by Short Block Moves (Q2942654) (← links)
- Weighted Minimum-Length Rearrangement Scenarios. (Q5091737) (← links)
- (Q5140777) (← links)
- Sorting of Permutations by Cost-Constrained Transpositions (Q5272144) (← links)