How to rank with few errors

Authors:
Claire Kenyon-Mathieu;Warren Schudy
Affiliations:
Brown University, Providence, RI;Brown University, Providence, RI
Venue:
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Year:
2007

Citing 14
Cited 47

Approximations for the maximum acyclic subgraph problem

Information Processing Letters
Learning to order things

NIPS '97 Proceedings of the 1997 conference on Advances in neural information processing systems 10
The importance of being biased

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
An Approximation Algorithm for Feedback Vertex Sets in Tournaments

SIAM Journal on Computing
An Approximation Algorithm for Feedback Vertex Sets in Tournaments

SIAM Journal on Computing
Divide-and-conquer approximation algorithms via spreading metrics

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
A new rounding procedure for the assignment problem with applications to dense graph arrangement problems

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Clustering with Qualitative Information

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Aggregating inconsistent information: ranking and clustering

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Ordering by weighted number of wins gives a good ranking for weighted tournaments

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Ranking Tournaments

SIAM Journal on Discrete Mathematics
Deterministic pivoting algorithms for constrained ranking and clustering problems

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Aggregation of partial rankings, p-ratings and top-m lists

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Computing slater rankings using similarities among candidates

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1

Hardness of fully dense problems

Information and Computation
Noisy sorting without resampling

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Aggregating inconsistent information: Ranking and clustering

Journal of the ACM (JACM)
Fixed-Parameter Algorithms for Kemeny Scores

AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
On the approximability of Dodgson and Young elections

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A randomized approximation algorithm for computing bucket orders

Information Processing Letters
Ranking tournaments: Local search and a new algorithm

Journal of Experimental Algorithmics (JEA)
A note on generalized rank aggregation

Information Processing Letters
How similarity helps to efficiently compute Kemeny rankings

Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Fast FAST

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems

Mathematics of Operations Research
Fixed-parameter algorithms for Kemeny rankings

Theoretical Computer Science
Fixed-parameter tractability results for feedback set problems in tournaments

Journal of Discrete Algorithms
Generalized distances between rankings

Proceedings of the 19th international conference on World wide web
Deterministic algorithms for rank aggregation and other ranking and clustering problems

WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
Ordering by weighted number of wins gives a good ranking for weighted tournaments

ACM Transactions on Algorithms (TALG)
Socially desirable approximations for Dodgson's voting rule

Proceedings of the 11th ACM conference on Electronic commerce
The unavailable candidate model: a decision-theoretic view of social choice

Proceedings of the 11th ACM conference on Electronic commerce
Using complexity to protect elections

Communications of the ACM
Supporting ranking queries on uncertain and incomplete data

The VLDB Journal — The International Journal on Very Large Data Bases
A polynomial time approximation scheme for k-consensus clustering

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Ranking from pairs and triplets: information quality, evaluation methods and query complexity

Proceedings of the fourth ACM international conference on Web search and data mining
Online ranking for tournament graphs

WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Average parameterization and partial kernelization for computing medians

Journal of Computer and System Sciences
Linear programming based approximation algorithms for feedback set problems in bipartite tournaments

Theoretical Computer Science
Ranking and drawing in subexponential time

IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Kernels for feedback arc set in tournaments

Journal of Computer and System Sciences
Homogeneity and monotonicity of distance-rationalizable voting rules

The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Using medians to generate consensus rankings for biological data

SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
Approximation schemes for the betweenness problem in tournaments and related ranking problems

APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Conflict packing yields linear vertex-kernels for k-FAST, k-dense RTI and a related problem

MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Using Kendall-τ meta-bagging to improve protein-protein docking predictions

PRIB'11 Proceedings of the 6th IAPR international conference on Pattern recognition in bioinformatics
Average parameterization and partial kernelization for computing medians

LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Kernel and fast algorithm for dense triplet inconsistency

TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
An active learning algorithm for ranking from pairwise preferences with an almost optimal query complexity

The Journal of Machine Learning Research
A polynomial kernel for feedback arc set on bipartite tournaments

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
So who won?: dynamic max discovery with the crowd

SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
On the approximability of Dodgson and Young elections

Artificial Intelligence
The feedback arc set problem with triangle inequality is a vertex cover problem

LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Sorting noisy data with partial information

Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Rank quantization

Proceedings of the sixth ACM international conference on Web search and data mining
Kernel and fast algorithm for dense triplet inconsistency

Theoretical Computer Science
Parameterized enumeration of (locally-) optimal aggregations

WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Kemeny elections with bounded single-peaked or single-crossing width

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Fully proportional representation as resource allocation: approximability results

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Socially desirable approximations for dodgson’s voting rule

ACM Transactions on Algorithms (TALG)
A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments

Theory of Computing Systems

Quantified Score

Hi-index	0.02

Visualization

Abstract

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.