Given a set A ⊆ Sn of m permutations of [n] and a distance function d, the median problem consists of finding a permutation π ∗ that is the “closest” of the m given permutations. Here, we study the problem under the Kendall-τ distance which counts the number of pairwise disagreements between permutations. This problem has been proved to be NP-hard when m ≥ 4, m even. In this article, we investigate new theoretical properties of A that will solve the relative order between pairs of elements in median permutations of A, thus drastically reducing the search space of the problem.
CITATION STYLE
Milosz, R., & Hamel, S. (2016). Medians of permutations: Building constraints. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9602, pp. 264–276). Springer Verlag. https://doi.org/10.1007/978-3-319-29221-2_23
Mendeley helps you to discover research relevant for your work.