A generalization of the assignment problem, and its application to the rank aggregation problem

Fundamenta Informaticae

Volumn 81, Issue 4, 2007, Pages 459-471

  Manea, Florin ^a   Ploscaru, Clina ^a  

^a UNIVERSITY OF BUCHAREST   (Romania)

Author keywords

Assignment Problem; Network flow; Rank Aggregation Problem; Ranking

Indexed keywords

ALGORITHMS; NETWORK MANAGEMENT;

ASSIGNMENT PROBLEMS; NETWORK FLOW; RANK AGGREGATION PROBLEMS;

PROBLEM SOLVING;

EID: 38049115252     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (12)

1. R. Ahuja, T. Magnanti, J. Orlin, Network Flows, Prentice Hall, Inc., 1993.
2. T.H. Cormen, C.E. Leiserson, R.R. Rivest, Introduction to Algorithms, MIT Press, 1990.
3. P. Diaconis, Group Representation in Probability and Statistics, IMS Lecture Series 11, IMS, 1988.
4. A. Dinu, L. P. Dinu, On the Syllabic Similarities of Romance Languages, LNCS, 3406, 785-788, 2005.
5. L. P. Dinu, On the classification and aggregation of hierarchies with different constitutive elements, Fundamenta Informaticae, 55(1), 39-50, 2003.
6. L. P. Dinu, Rank Distance with Applications in Similarity of Natural Languages, Fundamenta Informaticae, 64(1-4), 135-149, 2005.
7. L.P. Dinu, A. Sgarro, A Low-complexity Distance for DNA Strings, Fundamenta Informaticae, 73(3), 361-372, 2006.
8. L.P. Dinu, F. Manea, An efficient approach for the rank aggregation problem, Theoretical Computer Science, 359 (1-3), 455-461, 2006.
9. C. Dwork, R. Kumar, M. Naor, and D. Sivakumar,Rank aggregation methods for the web, Proc. of the 10th International WWW Conference, 613-622, ACM, 2001.
10. H.W. Kuhn, The Hungarian method for assignment problem, Naval Research Logistics Quarterly, 2, 83-97, 1955.
11. F. Manea, C. Ploscaru, Solving a combinatorial problem with network flows, J. of Appl. Math, and Comp., 17(1-2), 391-399, 2005.
12. K. Mehlhorn, Graph Algorithms and NP-Completeness, in Data Structures and Algorithms, vol. II, Springer, 1984.