Abstract
We develop a technique that we call Conflict Packing in the context of kernelization [7]. We illustrate this technique on several well-studied problems: Feedback Arc Set in Tournaments, Dense Rooted Triplet Inconsistency and Betweenness in Tournaments. For the former, one is given a tournament T = (V,A) and seeks a set of at most k arcs whose reversal in T results in an acyclic tournament. While a linear vertex-kernel is already known for this problem [6], using the Conflict Packing allows us to find a so-called safe partition, the central tool of the kernelization algorithm in [6], with simpler arguments. Regarding the Dense Rooted Triplet Inconsistency problem, one is given a set of vertices V and a dense collection \(\mathcal{R}\) of rooted binary trees over three vertices of V and seeks a rooted tree over V containing all but at most k triplets from \(\mathcal{R}\). Using again the Conflict Packing, we prove that the Dense Rooted Triplet Inconsistency problem admits a linear vertex-kernel. This result improves the best known bound of O(k 2) vertices for this problem [16]. Finally, we use this technique to obtain a linear vertex-kernel for Betweenness in Tournaments, where one is given a set of vertices V and a dense collection \(\mathcal{R}\) of betweenness triplets and seeks an ordering containing all but at most k triplets from \(\mathcal{R}\). To the best of our knowledge this result constitutes the first polynomial kernel for the problem.
Research supported by the AGAPE project (ANR-09-BLAN-0159) and the Phylariane project (ANR-08-EMER-011-01).
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
Aho, A., Sagiv, Y., Szymansk, T., Ullman, J.: Inferring a tree from lowest common ancestor with an application to the optimization of relational expressions. SIAM Journal on Computing 10(3), 405–421 (1981)
Ailon, N., Alon, N.: Hardness of fully dense problems. Inf. Comput. 205(8), 1117–1129 (2007)
Alon, N.: Ranking tournaments. SIAM J. Discrete Math. 20(1), 137–142 (2006)
Alon, N., Lokshtanov, D., Saurabh, S.: Fast FAST. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5555, pp. 49–58. Springer, Heidelberg (2009)
Bandelt, H.-J., Dress, A.: Reconstructing the shape of a tree from observed dissimilarity data. Advances in Applied Mathematics 7, 309–343 (1986)
Bessy, S., Fomin, F.V., Gaspers, S., Paul, C., Perez, A., Saurabh, S., Thomassé, S.: Kernels for feedback arc set in tournaments. In: FSTTCS 2009. LIPIcs, vol. 4, pp. 37–47 (2009)
Bodlaender, H.L.: Kernelization: New upper and lower bound techniques. In: Chen, J., Fomin, F.V. (eds.) IWPEC 2009. LNCS, vol. 5917, pp. 17–37. Springer, Heidelberg (2009)
Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. North-Holland, Amsterdam (1976)
Brügmann, D., Komusiewicz, C., Moser, H.: On generating triangle-free graphs. Electronic Notes in Discrete Mathematics 32, 51–58 (2009)
Byrka, J., Guillemot, S., Jansson, J.: New results on optimizing rooted triplets consistency. Discrete Applied Mathematics 158(11), 1136–1147 (2010)
Charbit, P., Thomassé, S., Yeo, A.: The minimum feedback arc set problem is NP-hard for tournaments. Combin. Probab. Comput. 16(1), 1–4 (2007)
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)
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
Erdös, P., Moon, J.W.: On sets on consistent arcs in tournaments. Canad. Math. Bull. 8, 269–271 (1965)
Guillemot, S., Berry, V.: Fixed-parameter tractability of the maximum agreement supertree problem. IEEE/ACM Trans. Comput. Biology Bioinform. 7(2) (2010)
Guillemot, S., Mnich, M.: Kernel and fast algorithm for dense triplet inconsistency. In: Kratochvíl, J., Li, A., Fiala, J., Kolman, P. (eds.) TAMC 2010. LNCS, vol. 6108, pp. 247–257. Springer, Heidelberg (2010)
Hall, P.: On representatives of subsets. J. London Math. Soc. 10(37), 26–30 (1935)
Karpinski, M., Schudy, W.: Faster algorithms for feedback arc set tournament, kemeny rank aggregation and betweenness tournament. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010. LNCS, vol. 6506, pp. 3–14. Springer, Heidelberg (2010)
Kenyon-Mathieu, C., Schudy, W.: How to rank with few errors. In: STOC 2007, pp. 95–103 (2007)
Raman, V., Saurabh, S.: Parameterized algorithms for feedback set problems and their duals in tournaments. Theor. Comput. Sci. 351(3), 446–458 (2006)
Reid, K.D., Parker, E.T.: Disproof of a conjecture of Erdös and Moser on tournaments. J. Combin. Theory 9, 225–238 (1970)
Saurabh, S.: Chromatic coding and universal (hyper-)graph coloring families. Parameterized Complexity News, 49–58 (June 2009)
Semple, C., Steel, M.: Phylogenetics. Oxford Lecture Series in Mathematics and Its Applications, vol. 24. Oxford University Press, Oxford (2003)
Wang, J., Ning, D., Feng, Q., Chen, J.: An improved kernelization for P2-packing. Inf. Process. Lett. 110(5), 188–192 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag GmbH Berlin Heidelberg
About this paper
Cite this paper
Paul, C., Perez, A., Thomassé, S. (2011). Conflict Packing Yields Linear Vertex-Kernels for k -FAST, k -dense RTI and a Related Problem. In: Murlak, F., Sankowski, P. (eds) Mathematical Foundations of Computer Science 2011. MFCS 2011. Lecture Notes in Computer Science, vol 6907. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22993-0_45
Download citation
DOI: https://doi.org/10.1007/978-3-642-22993-0_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22992-3
Online ISBN: 978-3-642-22993-0
eBook Packages: Computer ScienceComputer Science (R0)