Add to ORKG6pp.Given m permutations π^1 , π^2, ... π^m of {1, 2, ... , n} and a distance function d, the median problem is to find a permutation π* that is the "closest" of the m given permutations. Here, we study the problem under the Kendall-τ distance that counts the number of pairwise disagreements between permutations. This problem is also known, in the context of rank aggregation, as the Kemeny Score Problem and has been proved to be NP-hard when m ≥ 4. In this article, we investigate the case m = 3
AbstractThe computation of Kemeny rankings is central to many applications in the context of rank ag...
AbstractLet us denote by R(k, ⩾ λ)[R(k, ⩽ λ)] the maximal number M such that there exist M different...
Preference rankings are data expressing preferences of individuals over a set of available alternati...
International audienceGiven m permutations π1, π2 . . . πm of {1, 2, . . . , n} and a distance funct...
Given m permutations pi1, pi2... pim of {1, 2,..., n} and a distance function d, the median problem ...
6pp.Given m permutations π^1 , π^2, ... π^m of {1, 2, ... , n} and a distance function d, the median...
In this report, we propose an effective way to find the medians of three permutations by minimizing ...
The Kemeny Score problem is central to many applications in the context of rank aggregation. Given a...
The breakpoint distance between two n-permutations is the number of pairs that appear consecutively...
We investigate crossing minimization problems for a set of permutations, where a crossing expresses ...
The rank aggregation problem consists in finding a consensus ranking on a set of alternatives, based...
AbstractWe investigate crossing minimization problems for a set of permutations, where a crossing ex...
Abstract Background Recently, Pereira Zanetti, Biller and Meidanis have proposed a new definition of...
Background Recently, Pereira Zanetti, Biller and Meidanis have proposed a new definition of a rearra...
The analysis of ranking data has recently received increasing attention in many fields (i.e. politic...
AbstractThe computation of Kemeny rankings is central to many applications in the context of rank ag...
AbstractLet us denote by R(k, ⩾ λ)[R(k, ⩽ λ)] the maximal number M such that there exist M different...
Preference rankings are data expressing preferences of individuals over a set of available alternati...
International audienceGiven m permutations π1, π2 . . . πm of {1, 2, . . . , n} and a distance funct...
Given m permutations pi1, pi2... pim of {1, 2,..., n} and a distance function d, the median problem ...
6pp.Given m permutations π^1 , π^2, ... π^m of {1, 2, ... , n} and a distance function d, the median...
In this report, we propose an effective way to find the medians of three permutations by minimizing ...
The Kemeny Score problem is central to many applications in the context of rank aggregation. Given a...
The breakpoint distance between two n-permutations is the number of pairs that appear consecutively...
We investigate crossing minimization problems for a set of permutations, where a crossing expresses ...
The rank aggregation problem consists in finding a consensus ranking on a set of alternatives, based...
AbstractWe investigate crossing minimization problems for a set of permutations, where a crossing ex...
Abstract Background Recently, Pereira Zanetti, Biller and Meidanis have proposed a new definition of...
Background Recently, Pereira Zanetti, Biller and Meidanis have proposed a new definition of a rearra...
The analysis of ranking data has recently received increasing attention in many fields (i.e. politic...
AbstractThe computation of Kemeny rankings is central to many applications in the context of rank ag...
AbstractLet us denote by R(k, ⩾ λ)[R(k, ⩽ λ)] the maximal number M such that there exist M different...
Preference rankings are data expressing preferences of individuals over a set of available alternati...