Ulam Rank Aggregation Is Hard to Approximate for Four Rankings

RESUMO

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 Ulam distances to the input rankings, while in the \emph{Ulam center} problem, the objective is to minimize the maximum such distance. We prove that, for every $0<\varepsilon< 1/34$, it is $\mathrm{NP}$-hard to approximate either Ulam median or Ulam center within a factor of $35/34-\varepsilon$, even when the input consists of only four rankings. We further show that unless P = NP, neither problem admits a polynomial-time additive approximation scheme. Prior to our work, only the exact versions of both problems were known to be $\mathrm{NP}$-hard, and that too only when the number of input rankings is unbounded [Fischer et al., ESA'25 and Bachmaier et al., J. of Discrete Algorithms'15]. Furthermore, our inapproximability results are optimal in terms of the number of input rankings since for three inputs it is already known to be polynomial-time solvable [Chakraborty, Das, Krauthgamer, SODA'21]. En route, we introduce a new general framework for reducing Boolean constraint satisfaction problems (CSP) to the Ulam median with only four inputs. As a specific instantiation of the reduction framework, we obtain our hardness-of-approximation results. The corresponding hardness for the Ulam center follows from a reduction from the Ulam median.