Complexity of computing median linear orders and variants
Author:
- Olivier HudryOHOlivier Hudry
- 1 June 2013
- journal article
- research article
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 42, 57-64
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- On the complexity of Slater’s problemsEuropean Journal of Operational Research, 2010
- An updated survey on the linear ordering problem for weighted or unweighted tournamentsAnnals of Operations Research, 2009
- NP-hardness results for the aggregation of linear orders into median ordersAnnals of Operations Research, 2008
- The Minimum Feedback Arc Set Problem is NP-Hard for TournamentsCombinatorics, Probability and Computing, 2006
- Ranking TournamentsSIAM Journal on Discrete Mathematics, 2006
- The complexity of Kemeny electionsTheoretical Computer Science, 2005
- Rank aggregation methods for the Web2001
- Slater orders and Hamiltonian paths of tournamentsElectronic Notes in Discrete Mathematics, 2000
- Voting schemes for which it can be difficult to tell who won the electionSocial Choice and Welfare, 1989
- The median procedure in cluster analysis and social choice theoryMathematical Social Sciences, 1981