An efficient approach for the rank aggregation problem
- 14 August 2006
- journal article
- research article
- Published by Elsevier BV in Theoretical Computer Science
- Vol. 359 (1-3), 455-461
- https://doi.org/10.1016/j.tcs.2006.05.024
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Hardness results for the center and median string problems under the weighted and unweighted edit distancesJournal of Discrete Algorithms, 2005
- Solving a combinatorial problem with network flowsJournal of Applied Mathematics and Computing, 2005
- On the Syllabic Similarities of Romance LanguagesLecture Notes in Computer Science, 2005
- Topology of strings: Median string is NP-completeTheoretical Computer Science, 2000
- Finding all minimum‐cost perfect matchings in Bipartite graphsNetworks, 1992
- Group representations in probability and statisticsPublished by Institute of Mathematical Statistics ,1988
- A Consistent Extension of Condorcet’s Election PrincipleSIAM Journal on Applied Mathematics, 1978
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955