On the hardness of maximum rank aggregation problems (Q2018536)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the hardness of maximum rank aggregation problems |
scientific article; zbMATH DE number 6419165
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the hardness of maximum rank aggregation problems |
scientific article; zbMATH DE number 6419165 |
Statements
On the hardness of maximum rank aggregation problems (English)
0 references
24 March 2015
0 references
center consensus
0 references
rank aggregation
0 references
maximum ranking
0 references
permutation metrics
0 references
computational complexity
0 references
FPT
0 references
0 references
0 references
0 references
0.87782085
0 references
0.86694694
0 references
0.8644551
0 references
0.8638338
0 references
0.8638338
0 references
0 references
0.85681933
0 references
0.8562283
0 references
