# How to rank with few errors

@inproceedings{Mathieu2007HowTR,
title={How to rank with few errors},
author={Claire Mathieu and Warren Schudy},
booktitle={STOC '07},
year={2007}
}
• Published in STOC '07 11 June 2007
• Mathematics
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for Kemeny-Young rank aggregation.
255 Citations

### Approximation Schemes for the Betweenness Problem in Tournaments and Related Ranking Problems

• Mathematics, Computer Science
APPROX-RANDOM
• 2011
We settle the approximability status of the Minimum Betweenness problem in tournaments by designing a polynomial time approximation scheme (PTAS). No constant factor approximation was previously

### The Feedback Arc Set Problem with Triangle Inequality Is a Vertex Cover Problem

We consider the (precedence constrained) Minimum Feedback Arc Set problem with triangle inequalities on the weights, which finds important applications in problems of ranking with inconsistent

### Fully Proportional Representation as Resource Allocation: Approximability Results

• Economics
IJCAI
• 2013
Good approximation algorithms are shown for the satisfaction-based utilitarian cases, and inapproximability results for the remaining settings are shown.

### Tight Upper Bounds for Minimum Feedback Arc Sets of Regular Graphs

• Mathematics
WG
• 2013
The Feedback problem is one of the classical $$\mathcal{NP}$$-hard problems. Given a graph with n vertices and m arcs, it asks for a subset of arcs whose deletion makes a graph acyclic. An equivalent

### Online Ranking for Tournament Graphs

• Mathematics
WAOA
• 2010
Both the maximization and the minimization versions of the problem of producing a global ranking of items given pairwise ranking information on tournaments (max acyclic subgraph, feedback arc set) are studied.

### Multiclass MinMax rank aggregation

• Computer Science
2017 IEEE International Symposium on Information Theory (ISIT)
• 2017
A new family of minmax rank aggregation problems under two distance measures, the Kendall τ and the Spearman footrule, and a number of constant-approximation algorithms for solving them are described.

### An Efficient Semi-Streaming PTAS for Tournament Feedback ArcSet with Few Passes

• Computer Science, Mathematics
ITCS
• 2022
This work presents the first semi-streaming polynomial-time approximation scheme (PTAS) for the minimum feedback arc set problem on directed tournaments in a small number of passes and presents a new time/space trade-off for 1-pass algorithms that solve the tournament feedback arcs set problem.

### On Maximum Rank Aggregation Problems

• Economics
IWOCA
• 2013
The rank aggregation problem consists in finding a consensus ranking on a set of alternatives, based on the preferences of individual voters. These are expressed by permutations, whose distance can

### Computing Kemeny Rankings from d-Euclidean Preferences

• Computer Science
• 2021
This work proposes an algorithm that finds an embeddable Kemeny ranking in d-Euclidean elections and achieves a polynomial runtime and thus demonstrates the algorithmic usefulness of the dEuclidesan restriction.

## References

SHOWING 1-10 OF 113 REFERENCES

### The importance of being biased

• Mathematics, Computer Science
STOC '02
• 2002
(MATH) We show that the Minimum Vertex Cover problem is NP-hard to approximate to within any factor smaller than $10\sqrt{5}-21 \approx 1.36067$, improving on the previously known hardness result for

### Ranking Tournaments

• N. Alon
• Mathematics
SIAM J. Discret. Math.
• 2006
It is shown that the feedback arc set problem for tournaments is NP-hard under randomized reductions, which settles a conjecture of Bang-Jensen and Thomassen.

### An Approximation Algorithm for Feedback Vertex Sets in Tournaments

• Mathematics
SIAM J. Comput.
• 2000
It is obtained that a 2.5-approximation polynomial time algorithm for the feedback vertex set problem in any tournament to possess the min-max relation on packing and covering directed cycles is found.

### How to rank with few errors: A PTAS for Weighted Feedback Arc Set on Tournaments

• Mathematics
Electron. Colloquium Comput. Complex.
• 2006
This work presents a polynomial time approximation scheme (PTAS) for Kemeny-Young rank aggregation, which is a simple weighted generalization that gives a PTAS for Kemany- young rank aggregation.

### Packing directed circuits fractionally

There is a set ofO (k logk log k logk) vertices meeting all directed circuits ofG, such that no “fractional” packing of directed circuit ofG has value >k, when every vertex is given “capacity” 1.

### Divide-and-conquer approximation algorithms via spreading metrics

• Computer Science, Mathematics
Proceedings of IEEE 36th Annual Foundations of Computer Science
• 1995
A polynomial time approximation algorithm for problems modelled by the novel divide-and-conquer paradigm, whose approximation factor is O (mi.tau), is presented.

### Aggregating inconsistent information: Ranking and clustering

• Computer Science
JACM
• 2008
This work almost settles a long-standing conjecture of Bang-Jensen and Thomassen and shows that unless NP⊆BPP, there is no polynomial time algorithm for the problem of minimum feedback arc set in tournaments.

### The computational difficulty of manipulating an election

• Economics, Computer Science
• 1989
A voting rule is exhibited that efficiently computes winners but is computationally resistant to strategic manipulation, showing how computational complexity might protect the integrity of social choice.

### A new rounding procedure for the assignment problem with applications to dense graph arrangement problems

• Mathematics
Proceedings of 37th Conference on Foundations of Computer Science
• 1996
Abstract.We present a randomized procedure for rounding fractional perfect matchings to (integral) matchings. If the original fractional matching satisfies any linear inequality, then with high