Pages that link to "Item:Q2271866"
From MaRDI portal
The following pages link to NP-hardness results for the aggregation of linear orders into median orders (Q2271866):
Displayed 8 items.
- Ranking data with ordinal labels: optimality and pairwise aggregation (Q374178) (← links)
- On the computation of median linear orders, of median complete preorders and of median weak orders (Q449031) (← links)
- Primary facets of order polytopes (Q730181) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- \(k\)-majority digraphs and the hardness of voting with a constant number of voters (Q2316935) (← links)
- Complexity results for extensions of median orders to different types of remoteness (Q2348767) (← links)
- Self-tuning of the noising methods (Q3646090) (← links)
- Voting Procedures, Complexity of (Q5150301) (← links)