Pages that link to "Item:Q2018536"
From MaRDI portal
The following pages link to On the hardness of maximum rank aggregation problems (Q2018536):
Displaying 11 items.
- Ranking chain sum orders (Q290525) (← links)
- Rank aggregation in cyclic sequences (Q523159) (← links)
- A note on permutations and rank aggregation (Q611777) (← links)
- On the complexity of crossings in permutations (Q1011761) (← links)
- Sorting of decision-making methods based on their outcomes using dominance-vector hesitant fuzzy-based distance (Q2001162) (← links)
- NP-hardness results for the aggregation of linear orders into median orders (Q2271866) (← links)
- On the complexity of ``Superdetermined'' minrank instances (Q2302132) (← links)
- An efficient approach for the rank aggregation problem (Q2503315) (← links)
- Aggregating preferences represented by conditional preference networks (Q2695422) (← links)
- The Complexity Landscape of Outcome Determination in Judgment Aggregation (Q5139591) (← links)
- Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems (Q5443388) (← links)