Fast FAST

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5555 LNCS, Issue PART 1, 2009, Pages 49-58

  Alon, Noga ^a,b   Lokshtanov, Daniel ^c   Saurabh, Saket ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b INSTITUTE FOR ADVANCED STUDY   (United States)

^c UNIVERSITY OF BERGEN   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

FEEDBACK ARC SET IN TOURNAMENTS; GRAPH G; NON-TRIVIAL; PARAMETERIZED ALGORITHM; POLYNOMIAL SPACE; RUNNING TIME; SUBEXPONENTIAL TIME; UNIVERSAL HASH FUNCTION; VERTEX COLORING;

COLORING; FIRE FIGHTING EQUIPMENT; HASH FUNCTIONS; LINGUISTICS; TRANSLATION (LANGUAGES);

SET THEORY;

EID: 70350583551     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02927-1_6     Document Type: Conference Paper

References (35)

1. Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: ranking and clustering. In: ACM Symposium on Theory of Computing (STOC), pp. 684-693 (2005)
2. Alon, N.: Ranking tournaments. SIAM J. Discrete Math. 20, 137-142 (2006)
3. Alon, N., Babai, L., Itai, A.: A fast and simple randomized parallel algorithm for the maximal independent set problem. Journal of Algorithms 7, 567-583 (1986)
4. Alon, N., Yuster, R., Zwick, U.: Color-coding. J. Assoc. Comput. Mach. 42, 844-856 (1995)
5. Borda, J.: Mémoire sur les élections au scrutin, Histoire de l'Académie Royale des Sciences (1781)
6. Cai, L., Juedes, D.W.: On the existence of subexponential parameterized algorithms. J. Comput. Syst. Sci. 67, 789-807 (2003)
7. Cohen, W.W., Schapire, R.E., Singer, Y.: Learning to order things. In: Advances in neural information processing systems (NIPS), pp. 451-457 (1997)
8. Condorcet, M.: Essai sur l'application de l'analyse à la probabilité des décisions rendues à la pluralité des voix (1785)
9. Coppersmith, D., Fleischer, L., Rudra, A.: Ordering by weighted number of wins gives a good ranking for weighted tournaments. In: ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 776-782 (2006)
10. Demaine, E.D., Fomin, F.V., Hajiaghayi, M.T., Thilikos, D.M.: Subexponential parameterized algorithms on bounded-genus graphs and -minor-free graphs. J. ACM 52, 866-893 (2005)
11. Demaine, E.D., Hajiaghayi, M.: The bidimensionality theory and its algorithmic applications. Comput. J. 51, 292-302 (2008)
12. Dom, M., Guo, J., Hüffner, F., Niedermeier, R., Truß, A.: Fixed-parameter tractability results for feedback set problems in tournaments. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds.) CIAC 2006. LNCS, vol. 3998, pp. 320-331. Springer, Heidelberg (2006)
13. Dorn, F., Fomin, F.V., Thilikos, D.M.: Subexponential parameterized algorithms. Computer Science Review 2, 29-39 (2008)
14. Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation revisited (2001)
15. Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation methods for the web. In: WWW10 (2001)
16. Erdös, P., Moon, J.W.: On sets on consistent arcs in tournaments. Canadian Mathematical Bulletin 8, 269-271 (1965)
17. 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)
18. Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, Secaucus (2006)
19. Guo, J., Moser, H., Niedermeier, R.: Iterative compression for exactly solving np-hard minimization problems. In: Algorithmics of Large and Complex Networks. LNCS, Springer, Heidelberg (to appear, 2008)
20. Jung, H.: On subgraphs without cycles in tournaments. Combinatorial Theory and its Applications II, pp. 675-677 (1970)
21. Reid, K.B.: On sets of arcs containing no cycles in tournaments. Canad. Math Bulletin 12, 261-264 (1969)
22. Reid, K.D., Parker, E.T.: Disproof of a conjecture of Erdös and Moseron tournaments. J. Combin. Theory 9, 225-238 (1970)
23. Kemeny, J.: Mathematics without numbers. Daedalus 88, 571-591 (1959)
24. Kemeny, J., Snell, J.: Mathematical models in the social sciences, Blaisdell (1962)
25. Kenyon-Mathieu, C., Schudy, W.: How to rank with few errors. In: STOC 2007, pp. 95-103. ACM Press, New York (2007)
26. Nilli, A.: Perfect hashing and probability. Combinatorics, Probability and Computing 3, 407-409 (1994)
27. Raman, V., Saurabh, S.: Parameterized algorithms for feedback set problems and their duals in tournaments. Theoretical Computer Science 351, 446-458 (2006)
28. Seshu, S., Reed, M.: Linear Graphs and Electrical Networks. Addison-Wesley, Reading (1961)
29. Slater, P.: Inconsistencies in a schedule of paired comparisons. Biometrika 48, 303-312 (1961)
30. Speckenmeyer, E.: On feedback problems in diagraphs. In: Nagl, M. (ed.) WG 1989. LNCS, vol. 411, pp. 218-231. Springer, Heidelberg (1990)
31. Spencer, J.: Optimal ranking of tournaments. Networks 1, 135-138 (1971)
32. Spencer, J.: Optimal ranking of unrankable tournaments. Period. Math. Hun-gar. 11, 131-144 (1980)
33. van Zuylen, A.: Deterministic approximation algorithms for ranking and clusterings, Tech. Report 1431, Cornell ORIE (2005)
34. van Zuylen, A., Hegde, R., Jain, K., Williamson, D.P.: Deterministic pivoting algorithms for constrained ranking and clustering problems. In: ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 405-414 (2007)
35. Younger, D.: Minimum feedback arc sets for a directed graph. IEEE Trans. Circuit Theory 10, 238-245 (1963)