Sorting of Permutations by Cost-Constrained Transpositions

DOI10.1109/TIT.2011.2171532zbMath1365.05007arXiv1007.4236MaRDI QIDQ5272144

Olgica Milenković, Farzad Farnoud (Hassanzadeh)

Publication date: 12 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1007.4236

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Dynamic programming (90C39)

Related Items (6)

Optimal Shuffle Code with Permutation Instructions ⋮ Hofer-Zehnder capacity and Bruhat graph ⋮ Computing similarity distances between rankings ⋮ Weighted distances between preferences ⋮ Complexity of token swapping and its variants ⋮ Weighted Minimum-Length Rearrangement Scenarios.

This page was built for publication: Sorting of Permutations by Cost-Constrained Transpositions