Kernels for feedback arc set in tournaments - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles Journal of Computer and System Sciences Year : 2011

Kernels for feedback arc set in tournaments


A tournament T = (V;A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, the Feedback Arc Set problem asks whether the given digraph has a set of k arcs whose removal results in an acyclic digraph. The Feedback Arc Set problem restricted to tournaments is known as the k-Feedback Arc Set in Tournaments (k-FAST) problem. In this paper we obtain a linear vertex kernel for k-FAST. That is, we give a polynomial time algorithm which given an input instance T to k-FAST obtains an equivalent instance T0 on O(k) vertices. In fact, given any xed > 0, the kernelized instance has at most (2 + )k vertices. Our result improves the previous known bound of O(k2) on the kernel size for k-FAST. Our kernelization algorithm solves the problem on a subclass of tournaments in polynomial time and uses a known polynomial time approximation scheme for k-FAST.
Fichier principal
Vignette du fichier
fast.pdf (184.3 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

lirmm-00738221 , version 1 (03-10-2012)



Stéphane Bessy, Fedor V. Fomin, Serge Gaspers, Christophe Paul, Anthony Perez, et al.. Kernels for feedback arc set in tournaments. Journal of Computer and System Sciences, 2011, 77 (6), pp.1071-1078. ⟨10.1016/j.jcss.2010.10.001⟩. ⟨lirmm-00738221⟩
148 View
300 Download



Gmail Facebook X LinkedIn More