A polynomial algorithm for the 2-path problem for semicomplete digraphs
SIAM Journal on Discrete Mathematics
Approximations for the maximum acyclic subgraph problem
Information Processing Letters
Approximation alogorithms for the maximum acyclic subgraph problem
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Rank aggregation methods for the Web
Proceedings of the 10th international conference on World Wide Web
The importance of being biased
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Aggregating inconsistent information: ranking and clustering
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
SIAM Journal on Discrete Mathematics
New algorithms research for first year students
Proceedings of the 11th annual SIGCSE conference on Innovation and technology in computer science education
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
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
Feedback arc set problem in bipartite tournaments
Information Processing Letters
Noisy sorting without resampling
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Robust reductions from ranking to classification
Machine Learning
Aggregating inconsistent information: Ranking and clustering
Journal of the ACM (JACM)
Label ranking by learning pairwise preferences
Artificial Intelligence
Finding Total and Partial Orders from Data for Seriation
DS '08 Proceedings of the 11th International Conference on Discovery Science
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)
Decision tree and instance-based learning for label ranking
ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Computing slater rankings using similarities among candidates
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Improved bounds for computing Kemeny rankings
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems
Mathematics of Operations Research
On predictive accuracy and risk minimization in pairwise label ranking
Journal of Computer and System Sciences
Feedback arc set problem in bipartite tournaments
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Robust reductions from ranking to classification
COLT'07 Proceedings of the 20th annual conference on Learning theory
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
Community-based ranking of the social web
Proceedings of the 21st ACM conference on Hypertext and hypermedia
Group recommendations with rank aggregation and collaborative filtering
Proceedings of the fourth ACM conference on Recommender systems
Effective rank aggregation for metasearching
Journal of Systems and Software
Controlled Perturbation of sets of line segments in R2 with smart processing order
Computational Geometry: Theory and Applications
Online ranking for tournament graphs
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Preferences in AI: An overview
Artificial Intelligence
Clustering Algorithms for Chains
The Journal of Machine Learning Research
Kernels for feedback arc set in tournaments
Journal of Computer and System Sciences
Manipulating stochastically generated single-elimination tournaments for nearly all players
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
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
Rigging tournament brackets for weaker players
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Sorting noisy data with partial information
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Applying reinforcement learning for web pages ranking algorithms
Applied Soft Computing
Question routing to user communities
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Parameterized enumeration of (locally-) optimal aggregations
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Socially desirable approximations for dodgson’s voting rule
ACM Transactions on Algorithms (TALG)
A trust-augmented voting scheme for collaborative privacy management
Journal of Computer Security - STM'10
| Hi-index | 0.00 |
We consider the following simple algorithm for feedback arc set problem in weighted tournaments --- order the vertices by their weighted indegrees. We show that this algorithm has an approximation guarantee of 5 if the weights satisfy probability constraints (for any pair of vertices u and v, wuv + wvu = 1). Special cases of feedback arc set problem in such weighted tournaments include feedback arc set problem in unweighted tournaments and rank aggregation. Finally, for any constant ε 0, we exhibit an infinite family of (unweighted) tournaments for which the above algorithm (irrespective of how ties are broken) has an approximation ratio of 5 - ε.