Approximate maximum rank aggregation: beyond the worst-case

Cites work

A Consistent Extension of Condorcet’s Election Principle
A NEW MEASURE OF RANK CORRELATION
Aggregating inconsistent information: ranking and clustering
Approximate clustering via core-sets
Clustering permutations: new techniques with streaming applications
Complexities of the centre and median string problems
Data-driven rank breaking for efficient rank aggregation
Efficiently learning mixtures of Mallows models
Handbook of Computational Social Choice
scientific article; zbMATH DE number 3152611 (Why is no real title available?)
scientific article; zbMATH DE number 5485441 (Why is no real title available?)
scientific article; zbMATH DE number 3584785 (Why is no real title available?)
scientific article; zbMATH DE number 3073477 (Why is no real title available?)
scientific article; zbMATH DE number 7788386 (Why is no real title available?)
scientific article; zbMATH DE number 7799590 (Why is no real title available?)
Linear Programming in Linear Time When the Dimension Is Fixed
MM algorithms for generalized Bradley-Terry models.
More efficient algorithms for closest string and substring problems
Multiple genome rearrangement by swaps and by element duplications
NON-NULL RANKING MODELS. I
On covering problems of codes
On Finding the Jaccard Center
On reconstructing a hidden permutation
On the closest string and substring problems
On the complexity of crossings in permutations
On the hardness of maximum rank aggregation problems
Rank verification for exponential families
Robust voting rules from algorithmic robust statistics
Simple, Robust and Optimal Ranking from Pairwise Comparisons
The repeated insertion model for rankings: missing link between two subset choice models
Two Algorithms for the Minimum Enclosing Ball Problem

This page was built for publication: Approximate maximum rank aggregation: beyond the worst-case

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6951728)