Showing cs.CCShow all
2 papers · 1 filter
cs.CC2026
Ulam Rank Aggregation Is Hard to Approximate for Four Rankings
Sk Ruhul Azgor, Diptarka Chakraborty, Le Van Cuong +3
We study the approximability of rank aggregation under the Ulam metric. In the \emph{Ulam median} problem, the goal is to find a ranking (permutation) minimizing the sum of its Ula…
cs.CC2026
Hardness of Approximation of Rank Aggregation on Ulam Metric
Sk Ruhul Azgor, Diptarka Chakraborty, Le Van Cuong +2
We study the approximability of rank aggregation under the Ulam metric. In the \emph{Ulam median} problem, the goal is to find a permutation minimizing the sum of its Ulam distance…