On the hardness of maximum rank aggregation problems
DOI10.1016/J.JDA.2014.10.002zbMATH Open1322.68086OpenAlexW2087399592MaRDI QIDQ2018536FDOQ2018536
Authors: Christian Bachmaier, Franz J. Brandenburg, Andreas Gleißner, Andreas Hofmeier 
Publication date: 24 March 2015
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2014.10.002
Recommendations
- On maximum rank aggregation problems
- A generalization of the assignment problem, and its application to the rank aggregation problem
- An efficient approach for the rank aggregation problem
- Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
- On the complexity of the generalized MinRank problem
- Rank-maximal matchings -- structure and algorithms
- Rank-maximal matchings -- structure and algorithms
- On the complexity of ranking
- Classified rank-maximal matchings and popular matchings -- algorithms and hardness
- An algorithm for rank aggregation problem
Decision theory (91B06) Individual preferences (91B08) Combinatorics in computer science (68R05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cites Work
- Metric methods for analyzing partially ranked data
- Fundamentals of parameterized complexity
- Voting schemes for which it can be difficult to tell who won the election
- Algorithms on Strings, Trees and Sequences
- Aggregating inconsistent information
- Fixed-parameter algorithms for CLOSEST STRING and related problems
- Faster algorithms for feedback arc set tournament, Kemeny rank aggregation and betweenness tournament
- Title not available (Why is that?)
- Title not available (Why is that?)
- Comparing Partial Rankings
- On covering problems of codes
- Combinatorics of genome rearrangements.
- Title not available (Why is that?)
- On the complexity of crossings in permutations
- Fixed-parameter algorithms for Kemeny rankings
- Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
- The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders
- Comparing and aggregating partial orders with Kendall tau distances
- Comparing Top k Lists
- A Computer Method for Calculating Kendall's Tau with Ungrouped Data
- Title not available (Why is that?)
- On Maximum Rank Aggregation Problems
- Sorting by transpositions is difficult
- Sorting Permutations by Reversals and Eulerian Cycle Decompositions
- Swap and mismatch edit distance
- Metrics on permutations, a survey
- Multiple genome rearrangement by swaps and by element duplications
Cited In (10)
- On the complexity of ``Superdetermined minrank instances
- Sorting of decision-making methods based on their outcomes using dominance-vector hesitant fuzzy-based distance
- Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
- Ranking chain sum orders
- NP-hardness results for the aggregation of linear orders into median orders
- On the complexity of crossings in permutations
- A note on permutations and rank aggregation
- Aggregating preferences represented by conditional preference networks
- The Complexity Landscape of Outcome Determination in Judgment Aggregation
- An efficient approach for the rank aggregation problem
This page was built for publication: On the hardness of maximum rank aggregation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2018536)
