Abstract
Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed-parameter tractability results for these problems. We show that Feedback Vertex Set in tournaments is amenable to the novel iterative compression technique. Moreover, we provide data reductions and problem kernels for Feedback Vertex Set and Feedback Arc Set in tournaments, and a depth-bounded search tree for Feedback Arc Set in bipartite tournaments based on a new forbidden subgraph characterization.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: ranking and clustering. In: Proc. 37th STOC, pp. 684–693. ACM, New York (2005)
Alon, N.: Ranking tournaments. SIAM Journal on Discrete Mathematics 20(1), 137–142 (2006)
Cai, M.-C., Deng, X., Zang, W.: An approximation algorithm for feedback vertex sets in tournaments. SIAM Journal on Computing 30(6), 1993–2007 (2001)
Cai, M.-C., Deng, X., Zang, W.: A min-max theorem on feedback vertex sets. Mathematics of Operations Research 27(2), 361–371 (2002)
Charbit, P., Thomassé, S., Yeo, A.: The minimum feedback arc set problem is NP-hard for tournaments. Combinatorics, Probability and Computing (to appear, 2005)
Conitzer, V.: Computing Slater rankings using similarities among candidates. Technical Report RC23748, IBM Thomas J. Watson Research Center, Yorktown Heights, NY (2005)
Dehne, F.K.H.A., Fellows, M.R., Langston, M.A., Rosamond, F.A., Stevens, K.: An O(2O(k) n 3) FPT algorithm for the undirected feedback vertex set problem. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 859–869. Springer, Heidelberg (2005), To appear in Theory of Computing Systems
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
Fernau, H.: A top-down approach to search-trees: Improved algorithmics for 3-hitting set. Technical Report TR04-073, Electronic Colloquium on Computational Complexity (2004)
Festa, P., Pardalos, P.M., Resende, M.G.C.: Feedback set problems. In: Du, D.Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, vol. A, pp. 209–258. Kluwer, Dordrecht (1999)
Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
Fredman, M.L.: On computing the length of longest increasing subsequences. Discrete Mathematics 11(1), 29–35 (1975)
Guo, J., Gramm, J., Hüffner, F., Niedermeier, R., Wernicke, S.: Improved fixed-parameter algorithms for two feedback set problems. In: Dehne, F., López-Ortiz, A., Sack, J.-R. (eds.) WADS 2005. LNCS, vol. 3608, pp. 158–168. Springer, Heidelberg (2005), To appear in Journal of Computer and System Sciences
Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)
Niedermeier, R., Rossmanith, P.: An efficient fixed parameter algorithm for 3-Hitting Set. Journal of Discrete Algorithms 1(1), 89–102 (2003)
Raman, V., Saurabh, S.: Parameterized algorithms for feedback set problems and their duals in tournaments. Theoretical Computer Science 351(3), 446–458 (2006)
Reed, B., Smith, K., Vetta, A.: Finding odd cycle transversals. Operations Research Letters 32(4), 299–301 (2004)
Speckenmeyer, E.: On feedback problems in digraphs. In: Nagl, M. (ed.) WG 1989. LNCS, vol. 411, pp. 218–231. Springer, Heidelberg (1990)
Truß, A.: Parameterized algorithms for feedback set problems in tournaments (in German). Diplomarbeit, Institut für Informatik, Friedrich-Schiller-Universität Jena (December 2005)
van Zuylen, A.: Deterministic approximation algorithms for ranking and clustering problems. Technical Report 1431, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY (September 2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dom, M., Guo, J., Hüffner, F., Niedermeier, R., Truß, A. (2006). Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments. In: Calamoneri, T., Finocchi, I., Italiano, G.F. (eds) Algorithms and Complexity. CIAC 2006. Lecture Notes in Computer Science, vol 3998. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11758471_31
Download citation
DOI: https://doi.org/10.1007/11758471_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34375-2
Online ISBN: 978-3-540-34378-3
eBook Packages: Computer ScienceComputer Science (R0)