On the hardness of maximum rank aggregation problems
type: Item
instance of: scholarly article
title: On the hardness of maximum rank aggregation problems
zbMATH Open document ID: 1322.68086
author: Christian Bachmaier
author: Franz J. Brandenburg
author: Andreas Gleißner
author: Andreas Hofmeier
published in: Journal of Discrete Algorithms
publication date: 2015-03-24T00:00:00Z
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68R05
Mathematics Subject Classification ID: 91B06
Mathematics Subject Classification ID: 91B08
zbMATH DE Number: 6419165
zbMATH Keywords: center consensus
zbMATH Keywords: rank aggregation
zbMATH Keywords: maximum ranking
zbMATH Keywords: permutation metrics
zbMATH Keywords: computational complexity
zbMATH Keywords: FPT
MaRDI profile type: Publication
full work available at URL: j.jda.2014.10.002
OpenAlex ID: W2087399592
cites work: Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
cites work: Aggregating inconsistent information
cites work: Swap and mismatch edit distance
cites work: On Maximum Rank Aggregation Problems
cites work: Voting schemes for which it can be difficult to tell who won the election
cites work: Fixed-parameter algorithms for Kemeny rankings
cites work: On the complexity of crossings in permutations
cites work: Comparing and aggregating partial orders with Kendall tau distances
cites work: The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders
cites work: Sorting by Transpositions Is Difficult
cites work: Sorting Permutations by Reversals and Eulerian Cycle Decompositions
cites work: Metric methods for analyzing partially ranked data
cites work: Q3020034
cites work: Q4153936
cites work: Fundamentals of parameterized complexity
cites work: Q4058132
cites work: Comparing Top k Lists
cites work: Comparing Partial Rankings
cites work: Q3393448
cites work: On covering problems of codes
cites work: Fixed-parameter algorithms for CLOSEST STRING and related problems
cites work: Algorithms on Strings, Trees and Sequences
cites work: Faster Algorithms for Feedback Arc Set Tournament, Kemeny Rank Aggregation and Betweenness Tournament
cites work: Q3549601
cites work: A Computer Method for Calculating Kendall's Tau with Ungrouped Data
cites work: Q5710169
cites work: Multiple genome rearrangement by swaps and by element duplications
DOI: 10.1016/J.JDA.2014.10.002
Recommended article: On Maximum Rank Aggregation Problems
Recommended article: Q5445182
Recommended article: An efficient approach for the rank aggregation problem
Recommended article: Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
Recommended article: On the complexity of the generalized MinRank problem
Recommended article: Rank-maximal matchings -- structure and algorithms
Recommended article: On the complexity of ranking
Recommended article: Classified rank-maximal matchings and popular matchings -- algorithms and hardness
Recommended article: An algorithm for rank aggregation problem
description: scientific article; zbMATH DE number 6419165