arXiv (All)
open access
Ulam Rank Aggregation Is Hard to Approximate for Four Rankings
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 suc
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Ulam Median is NP-hard for Four Permutations#987773
- Ranking and Rank Aggregation with Matroid Prefix Constraints#1155258
- Same Ranking, Different Winner: How Scoring Targets Shape LLM Memory Benchmarks#677610
- Same Ranking, Different Winner: How Scoring Targets Shape LLM Memory Benchmarks#674410
- LlamaRec-LKG-RAG: A Single-Pass, Learnable Knowledge Graph-RAG Framework for LLM-Based Ranking#609791
Record · ID 973494
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive