Pages that link to "Item:Q5272144"
From MaRDI portal
The following pages link to Sorting of Permutations by Cost-Constrained Transpositions (Q5272144):
Displaying 9 items.
- Complexity of token swapping and its variants (Q722547) (← links)
- Approximation algorithms for sorting permutations by fragmentation-weighted operations (Q1660115) (← links)
- Approximation algorithms for sorting permutations by length-weighted short rearrangements (Q2132329) (← links)
- Hofer-Zehnder capacity and Bruhat graph (Q2175873) (← links)
- Computing similarity distances between rankings (Q2410235) (← links)
- Weighted distances between preferences (Q2444691) (← links)
- Optimal Shuffle Code with Permutation Instructions (Q3449851) (← links)
- Weighted Minimum-Length Rearrangement Scenarios. (Q5091737) (← links)
- (Q5140777) (← links)