Ranking tournaments: Local search and a new algorithm

Proceedings of the 10th Workshop on Algorithm Engineering and Experiments and the 5th Workshop on Analytic Algorithmics and Combinatorics

Volumn , Issue , 2008, Pages 133-141

  Coleman, Tom ^a   Wirth, Anthony ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; LOCAL SEARCH (OPTIMIZATION); POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

FEEDBACK ARC SETS; IN-DEGREE; LOCAL SEARCH; LOCAL SEARCH ALGORITHM; LOCAL SEARCH TECHNIQUES; ORGANIZATIONAL ACTIVITIES; POLYNOMIAL TIME APPROXIMATION SCHEMES; RANK AGGREGATION; SET PROBLEMS; TOTAL ORDERING;

DIRECTED GRAPHS;

EID: 58349110726     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972887.13     Document Type: Conference Paper

References (23)

1. AILON, N., CHARIKAR, M., AND NEWMAN. A. Aggregating inconsistent information: ranking and clustering. Proceedings of the thirty-seventh annual ACM symposium on Theory of Computing (2005), 684-693.
2. ALI, I., COOK, W., AND KRESS, M. On the Minimum Violations Ranking of a Tournament. Management Science 32, 6 (1986), 660-672.
3. ARORA, S., FRIEZE, A., AND KAPLAN, H. A new rounding procedure for the assignment problem with applications to dense graph arrangement problems. Mathematical Programming 92, 1 (2002), 1-36.
4. ARYA, V., GARG, N., KHANDEKAR, R., MEYERSON, A., MUNAGALA, K., AND PANDIT, V. Local Search Heuristics for k-Median and Facility Location Problems. SIAM Journal on Computing 33, 3, 544-562.
5. ASLAM, j., AND MONTAGUE, M. Models for metasearch. Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval (2001), 276-284.
6. CHANAS, S., AND KOBYLAŃSKI, P. A new heuristic algorithm solving the linear ordering problem. Computational Optimization and Applications 6, 2 (1996), 191-205.
7. CHARBIT, P., THOMASSÉ, S., AND YEO, A. The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments. Combinatorics, Probability and Computing 16, Of (2006), 1-4.
8. COOK, W., GOLAN, I., AND KRESS, M. Heuristics for ranking players in a round robin tournament. Computers and Operations Research 15, 2 (1988), 135-144.
9. COPPERSMITH, D., FLEISCHER, L., AND RUDRA, A. Ordering by weighted number of wins gives a good ranking for weighted tournaments. Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm (2006), 776-782.
10. DWORK, C., KUMAR, R., NAOR, M., AND SIVAKU-MAR, D. Rank aggregation revisited. Proceedings of WWW10 (2001), 613-622.
11. EADES, P., LIN, X., AND SMYTH, W. A Fast and Effective Heuristic for the Feedback Arc Set Problem. Information Processing Letters 47, 6 (1993), 319-323.
12. EADES, P., AND WORMALD, N. Edge crossings in drawings of bipartite graphs. Algorithmica 11, 4 (1994), 379-403.
13. JOHNSON, D. Finding All the Elementary Circuits of a Directed Graph. SIAM J. Comput. 4, 1 (1975), 77-84.
14. KANUNGO, T., MOUNT, D., NETANYAHU, N., PIATKO, C., SILVERMAN, R., AND WU, A. A local search approximation algorithm for k c-means clustering. Computational Geometry: Theory and Applications 28, 2-3 (2004), 89-112.
15. KARP, R. M. Reducibility among combinatorial problems. Complexity of Computer Computations (1972), 85-103.
16. KEMENY, J. Mathematics without numbers. Daedalus 88 (1959), 571-591.
17. KENDALL, M. Further Contributions to the Theory of Paired Comparisons. Biometrics 11, 1 (1955), 43-62.
18. KENYON-MATHIEU, C., AND SCHUDY, W. How to rank with few errors. Proceedings of the thirty-ninth annual ACM symposium on Theory of Computing (2007).
19. KLEIN, D., AND RANDIĆ, M. Innate degree of freedom of a graph. Journal of Computational Chemistry 8, 4 (1987), 516-521.
20. MCJONES, P. Eachmovie collaborative filtering data set. DEC Systems Research Center 249 (1997).
21. PACHTER, L., AND KIM, P. Forcing matchings on square grids. Discrete Mathematics 190, 1-3 (1998), 287-294.
22. PARK, L., AND RAMAMOHANARAO, K. Mining web multi-resolution community-based popularity for information retrieval, fn Proceedings of the 2007 ACM 16th Conference on Information and Knowledge Manage-merit (2007), pp. 545-52.
23. SAAB, Y. A Fast and Effective Algorithm for the Feedback Arc Set Problem. Journal of Heuristics 7, 3 (2001), 235-250.