A graphical model for computing the minimum cost transposition distance

Abstract

We address the problem of finding the minimum decomposition of a permutation in terms of transpositions with non-uniform cost. For metric-path costs, we describe exact polynomial-time decomposition algorithms. For extended-metric-path cost functions, we describe polynomial-time constant-approximation decomposition algorithms. Our algorithms rely on… (More)

2 Figures and Tables

Topics

  • Presentations referencing similar topics