Fixed-parameter tractability results for feedback set problems in tournaments

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

Volumn 3998 LNCS, Issue , 2006, Pages 320-331

  Dom, Michael ^a   Guo, Jiong ^a   Hüffner, Falk ^a   Niedermeier, Rolf ^a   Truß, Anke ^a  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA REDUCTION; ITERATIVE METHODS; PROBLEM SOLVING; TREES (MATHEMATICS);

BIPARTITE TOURNAMENTS; FEEDBACK SET PROBLEMS; FIXED-PARAMETER TRACTABILITY; SUBGRAPH CHARACTERIZATION;

COMPUTATIONAL COMPLEXITY;

EID: 33746059372     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11758471_31     Document Type: Conference Paper

References (22)

1. N. Ailon, M. Charikar, and A. Newman. Aggregating inconsistent information: ranking and clustering. In Proc. 37th STOC, pages 684-693. ACM, 2005.
2. N. Alon. Ranking tournaments. SIAM Journal on Discrete Mathematics, 20(1):137-142, 2006.
3. M.-C. Cai, X. Deng, and W. Zang. An approximation algorithm for feedback vertex sets in tournaments. SIAM Journal on Computing, 30(6):1993-2007, 2001.
4. M.-C. Cai, X. Deng, and W. Zang. A min-max theorem on feedback vertex sets. Mathematics of Operations Research, 27(2):361-371, 2002.
5. P. Charbit, S. Thomassé, and A. Yeo. The minimum feedback arc set problem is NP-hard for tournaments. Combinatorics, Probability and Computing, 2005. To appear.
6. V. Conitzer. Computing Slater rankings using similarities among candidates. Technical Report RC23748, IBM Thomas J. Watson Research Center, Yorktown Heights, NY, 2005.
7. F. K. H. A. Dehne, M. R. Fellows, M. A. Langston, F. A. Rosamond, and K. Stevens. An O(2O(k)n3) FPT algorithm for the undirected feedback vertex set problem. In Proc. 11th COCOON, volume 3595 of LNCS, pages 859-869. Springer, 2005.
8. To appear in Theory of Computing Systems.
9. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer, 1999.
10. H. Fernau. A top-down approach to search-trees: Improved algorithmics for 3-hitting set. Technical Report TR04-073, Electronic Colloquium on Computational Complexity, 2004.
11. P. Festa, P. M. Pardalos, and M. G. C. Resende. Feedback set problems. In D. Z. Du and P. M. Pardalos, editors, Handbook of Combinatorial Optimization, Vol. A, pages 209-258. Kluwer, 1999.
12. J. Flum and M. Grohe. Parameterized Complexity Theory. Springer, 2006.
13. M. L. Fredman. On computing the length of longest increasing subsequences. Discrete Mathematics, 11(1):29-35, 1975.
14. J. Guo, J. Gramm, F. Hüffner, R. Niedermeier, and S. Wernicke. Improved fixed-parameter algorithms for two feedback set problems. In Proc. 9th WADS, volume 3608 of LNCS, pages 158-168. Springer, 2005.
15. To appear in Journal of Computer and System Sciences.
16. R. Niedermeier. Invitation to Fixed-Parameter Algorithms. Oxford University Press, 2006.
17. R. Niedermeier and P. Rossmanith. An efficient, fixed parameter algorithm for 3-Hitting Set. Journal of Discrete Algorithms, 1(1):89-102, 2003.
18. V. Raman and S. Saurabh. Parameterized algorithms for feedback set problems and their duals in tournaments. Theoretical Computer Science, 351(3):446-458, 2006.
19. B. Reed, K. Smith, and A. Vetta. Finding odd cycle transversals. Operations Research Letters, 32(4):299-301, 2004.
20. E. Speckenmeyer. On feedback problems in digraphs. In Proc. 15th WG, volume 411 of LNCS, pages 218-231. Springer, 1989.
21. A. Truß. Parameterized algorithms for feedback set problems in tournaments (in German). Diplomarbeit, Institut für Informatik, Friedrich-Schiller-Universität Jena, Dec. 2005.
22. A. van Zuylen. Deterministic approximation algorithms for ranking and clustering problems. Technical Report 1431, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY, Sept. 2005.