An efficient approach for the rank aggregation problem

Theoretical Computer Science

Volumn 359, Issue 1-3, 2006, Pages 455-461

  Dinu, Liviu P ^a   Manea, Florin ^a  

^a UNIVERSITY OF BUCHAREST   (Romania)

Author keywords

Assignment problem; Bipartite matching of given cardinality and weight; Rank aggregation problem; Ranking; String distance

Indexed keywords

EFFICIENCY; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

ASSIGNMENT PROBLEMS; BIPARTITE MATCHING OF GIVEN CARDINALITY AND WEIGHT; RANK AGGREGATION PROBLEM; RANKING; STRING DISTANCE;

COMPUTATIONAL COMPLEXITY;

EID: 33746571467     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.05.024     Document Type: Article

References (15)

1. Ahuja R., Magnanti T., and Orlin J. Network Flows (1993), Prentice-Hall, Englewood Cliffs, NJ
2. Arrow K.J. Social Choice and Individual Values. second ed. (1963), Wiley, New York
3. P. Diaconis, Group Representation in Probability and Statistics, IMS Lecture Series, Vol. 11, IMS, 1988.
4. Diaconis P., and Graham R.L. Spearman footrule as a measure of disarray. J. Roy. Statist. Soc. Ser. B (Methodological) 39 2 (1977) 262-268
5. Dinu L.P. On the classification and aggregation of hierarchies with different constitutive elements. Fund. Inform. 55 1 (2003) 39-50
6. L.P. Dinu, A. Dinu, On the Syllabic Similarities of Romance Languages, Lecture Notes in Computer Science, Vol. 3406, 2005, pp. 785-788.
7. Dwork C., Kumar R., Naor M., and Sivakumar D. Rank aggregation methods for the web. Proc. of the 10th Internat. WWW Conf. (2001), ACM, New York 613-622
8. Fukuda K., and Matsui T. Finding all minimum cost perfect matchings in bipartite graphs. Networks 22 (1992) 461-468
9. de la Higuera C., and Casacuberta F. Topology of strings: Median string is NP-complete. Theoret. Comput. Sci. 230 (2000) 39-48
10. Kuhn H.W. The Hungarian method for assignment problem. Naval Res. Logist. Quarterly 2 (1955) 83-97
11. Levenshtein V.I. Binary codes capable of correcting deletions, insertions and reversals. Cybernet. Control Theory 10 8 (1966) 707-710
12. Manea F., and Ploscaru C. Solving a combinatorial problem with network flows. J. Appl. Math. Comput. 17 1-2 (2005) 391-399
13. Marcus S., Nicolau E., and Stati S. Introduzione alle linguistica matematica (1971), Casa Editrice Riccardo Patron, Bologna
14. Nicolas F., and Rivals E. Hardness results for the center and median string problems under the weighted and unweighted edit distances. J. Discrete Algorithms 3 2-4 (2005) 390-415
15. Young H.P., and Levenglick A. A consistent extension of Condorcet's election principle. SIAM J. Appl. Math. 35 2 (1978) 285-300