How to rank with few errors

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2007, Pages 95-103

  Kenyon Mathieu, Claire ^a   Schudy, Warren ^a  

^a Brown Univerity   (United States)

Author keywords

Approximation algorithm; Feedback arc set; Kemeny Young rank aggregation; Max acyclic subgraph; Polynomial time approximation scheme; Tournament graphs

Indexed keywords

FEEDBACK ARC SETS; KEMENY-YOUNG RANK AGGREGATION; MAX ACYCLIC SUBGRAPHS; POLYNOMIAL-TIME APPROXIMATION SCHEMES; TOURNAMENT GRAPHS;

ERROR ANALYSIS; FEEDBACK CONTROL; PROBLEM SOLVING; SET THEORY;

POLYNOMIAL APPROXIMATION;

EID: 35448985753     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1250790.1250806     Document Type: Conference Paper

References (46)

1. Nir Ailon, Moses Charikar, Alantha Newman. Aggregating inconsistent information: ranking and clustering. ACM Symposium on Theory of Computing (STOC), pages 684-693, 2005.
2. Nir Ailon. Aggregation of Partial Rankings, p-Ratings and Top-m Lists. ACM-SIAM Symposium on Discrete Algorithms (SODA), 2007, 415-424.
3. N. Alon, Ranking tournaments, SIAM J. Discrete Math. 20 (2006), 137-142.
4. Sanjeev Arora, Alan Frieze, and Haim Kaplan. A New Rounding Procedure for the Assignment Problem with Applications to Dense Graph Arrangement Problems. IEEE Symposium on Foundations of Computer Science (FOCS) 1996: 24-33.
5. F.B.Baker and L.J.Hubert, Applications of combinatorial programming to data analysis: seriation using asymmetric proximity measures, British J. Math. Statis. Psych. 30 (1977) 154-164.
6. J. Borda,. Mémoire sur les élections au scrutin. Histoire de l'Académie Royale des Sciences, 1781.
7. M.C. Cai, X. Deng, W. Zang. An approximation algorithm for feedback vertex sets in tournaments. SIAM J. Computing v. 30 No. 6 pp. 1993-2007. 2001.
8. M. Charikar, V. Guruswami, and A. Wirth. Clustering with qualitative information. In FOCS, pages 524-533, 2003.
9. William W. Cohen, Robert E. Schapire and Yoram Singer. Learning to order things. Proceedings of the 1997 conference on Advances in neural information processing systems (NIPS): 451-457.
10. M. Condorcet. Essai sur l'application de l'analyse à la probabilité des décisions rendues à la pluralité des voix. 1785.
11. Conitzer, V. Computing Slater Rankings Using Similarities Among Candidates. Proceedings of the 21st National Conference on Artificial Intelligence (AAAI-06), Boston, MA, USA, 613-619. 2006.
12. D. Coppersmith, Lisa Fleischer, Atri Rudra: Ordering by weighted number of wins gives a good ranking for weighted tournaments. ACM-SIAM Symposium on Discrete Algorithms (SODA) 2006: 776-782.
13. C. Demetrescu and I. Finocchi. Break the "right" cycles and get the "best" drawing. In B.E. Moret and A. V. Goldberg, editors, Proceedings of the 2nd International Workshop on Algorithmic Engineering and Experiments (ALENEX), 171-182, 2000.
14. P. Diaconis and R. Graham. Spearman's footrule as a measure of disarray. J. of the Royal Statistical Society, 39(2), pages 262-268, 1977.
15. I. Dinur and S. Safra. The importance of being biased. In Proceedings on 34th Annual ACM Symposium on Theory of Computing, pages 33-42, 2002.
16. Cynthia Dwork, Ravi Kumar, Moni Naor, and D. Sivakumar. Rank aggregation revisited. Manuscript. 2001.
17. Cynthia Dwork, Ravi Kumar, Moni Naor, D. Sivakumar. Rank Aggregation Methods for the Web. WWW10. 2001.
18. P. Erdös and J.W.Moon, On sets on consistent arcs in tournaments, Canadian Mathematical Bulletin 8 (1965) 269-271.
19. G. Even, J. Naor, S. Rao, B. Schieber. Divide-and-conquer approximation algorithms via spreading metrics. Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 62-71, 1995.
20. Fernandez de la Vega, W. On the maximal cardinality of a consistent set of arcs in a random tournament, J. Combinatorial Theory, Ser. B 35:328-332 (1983).
21. M.M.Flood. Exact and Heuristic Algorithms for the Weighted Feedback Arc Set Problem: a Special Case of the Skew-Symmetric Quadratic Assignment Problem. Networks, 20:1-23, 1990.
22. Alan M. Frieze, Ravi Kannan: Quick Approximation to Matrices and Applications. Combinatorica 19(2): 175-220 (1999).
23. M. Grötschel, M. Jünger, G. Reinelt. Facets of the linear ordering polytope. Math Programming 33, 1985, 43-60.
24. M. Grötschel, M. Jünger, G. Reinelt. On the acyclic subgraph polytope. Math. Programming 33, 1985, 28-42.
25. R. Hassin and S. Rubinstein. Approximations for the maximum acyclic subgraph problem. Information processing letters 51 (1994) 133-140.
26. H.A. Jung, On subgraphs without cycles in tournaments, Combinatorial Theory and its Applications II, North Holland (1970) 675-677.
27. M. Jünger, Polyhedral combinatorics and the Acyclic Subdigraph Problem (Heldermann Verlag, Berlin, 1985).
28. Karp, R., 1972. Reducibility among combinatorial problems. In: Miller, R. E., Thatcher, J. W. (Eds.), Complexity of Computer Computations. Plenum Press, NY, pp. 85-103.
29. J. Kemeny. Mathematics without numbers. Daedalus, 88:571-591, 1959.
30. J. Kemeny and J. Snell. Mathematical models in the social sciences. Blaisdell, New York, 1962. Reprinted by MIT press, Cambridge, 1972.
31. Claire Kenyon-Mathieu and Warren Schudy. How to rank with few errors: A PTAS for Weighted Feedback Arc Set on Tournaments ECCC Report TR06-144, Nov 2006.
32. B. Korte, Approximative algorithms for discrete optimization problems, Ann. Discrete Math 4 (1979), 85-120.
33. T. Leighton and S. Rao. An approximate max-fiow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In Proceedings of the 29th Annual Symposium on Foundations of Computer Science, pages 422-431. IEEE, October 1988.
34. A. Lempel and I. Cederbaum. Minimum feedback arc and vertex set of a directed graph. IEEE Trans. Circuit Theory, 13(4): 399-403, 1966.
35. K.B.Reid, On sets of arcs containing no cycles in tournaments, Canad. Math Bulletin 12 (1969) 261-264.
36. K.D.Reid and E.T.Parker, Disproof of a conjecture of Erdös and Moser on tournaments, J. Combin. Theory 9 (1970) 225-238.
37. S. Seshu and M.B. Reed, Linear Graphs and Electrical Networks, Addison-Wesley, Reading, MA, 1961. Attribute the problem of the minimum feedback arc set to Runyon.
38. P.D.Seymour. Packing directed circuit fractionally. Combinatorica 15:281-288, 1995.
39. P. Slater, Inconsistencies in a schedule of paired comparisons, Biometrika 48 (1961) 303-312.
40. J. Spencer, Optimal ranking of tournaments, Networks 1(1971) 135-138.
41. J. Spencer, Optimal ranking of unrankable tournaments, Period. Math. Hungar. 11-2 (1980) 131-144.
42. K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical system structures. IEEE Trans. Syst. Man Cybern., 11(2):109-125, 1981.
43. A.W.Tucker. On directed graphs and integer programs. Presented at 1960 Symposium on Combinatorial Problems, Princeton University, cited in [44].
44. D.H. Younger. Minimum feedback arc sets for a directed graph. IEEE Trans. Circuit Theory 10 (1963), 238-245.
45. A. van Zuylen. Deterministic approximation algorithms for ranking and clusterings. Cornell ORIE Tech report No. 1431. 2005.
46. Anke van Zuylen, Rajneesh Hegde, Kamal Jain and David P. Williamson. Deterministic pivoting algorithms for constrained ranking and clustering problems. ACM-SIAM Symposium on Discrete Algorithms (SODA), 2007, 405-414.