On maximum rank aggregation problems
From MaRDI portal
Recommendations
Cited in
(19)- On the complexity of crossings in permutations
- Efficient algorithms using subiterative convergence for Kemeny ranking problem
- On the minimax decision rules in ranking problems
- On the hardness of maximum rank aggregation problems
- NP-hardness results for the aggregation of linear orders into median orders
- An algorithm for rank aggregation problem
- The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders
- Popular ranking
- An efficient approach for the rank aggregation problem
- An algorithmic view of voting
- Comparing and aggregating partial orders with Kendall tau distances
- Comparing and aggregating partial orders with Kendall tau distances
- The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders
- Approximate rank aggregation (preliminary version)
- Rank of Handelman hierarchy for Max-Cut
- Rank aggregation in cyclic sequences
- Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
- Graph Drawing
- A note on permutations and rank aggregation
This page was built for publication: On maximum rank aggregation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2870013)