Graph algorithms and NP-completeness
Graph algorithms and NP-completeness
Introduction to algorithms
Rank aggregation methods for the Web
Proceedings of the 10th international conference on World Wide Web
On the classification and aggregation of hierarchies with different constitutive elements
Fundamenta Informaticae
An efficient approach for the rank aggregation problem
Theoretical Computer Science
Rank Distance with Applications in Similarity of Natural Languages
Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus
A Low-complexity Distance for DNA Strings
Fundamenta Informaticae
On the syllabic similarities of romance languages
CICLing'05 Proceedings of the 6th international conference on Computational Linguistics and Intelligent Text Processing
A Multi-Criteria Decision Method Based on Rank Distance
Fundamenta Informaticae
Rank distance aggregation as a fixed classifier combining rule for text categorization
CICLing'10 Proceedings of the 11th international conference on Computational Linguistics and Intelligent Text Processing
A note on permutations and rank aggregation
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.00 |
In this paper we propose a generalization of the Assignment Problem. First, we describe an algorithm, based on network flow techniques, that obtains just one solution of the approached problem; further, we develop an algorithm that is able to find all the solutions. Finally, we discuss how this general form of the Assignment Problem can be applied in solving the Rank Aggregation Problem, in the case of rankings with ties.