Abstract
Given an undirected simple graph G, a subset T of vertices is an r-clique transversal if it has at least one vertex from every r-clique in G. I.e. T is an r-clique transversal if G − S is K r -free. r-clique transversals generalize vertex covers as a vertex cover is a set of vertices whose deletion results in a graph that is K 2-free. Perfect graphs are a well-studied class of graphs on which a minimum vertex cover can be obtained in polynomial time. However, the problem of finding a minimum r-clique transversal is NP-hard even for r = 3. As any induced odd length cycle in a perfect graph is a triangle, a triangle-free perfect graph is bipartite. I.e. in perfect graphs, a 3-clique transversal is an odd cycle transversal. In this work, we describe an \((\frac{r+1}{2})\)-approximation algorithm for r-clique transversal on weighted perfect graphs improving on the straightforward r-approximation algorithm. We then show that 3-Clique Transversal is APX-hard on perfect graphs and it is NP-hard to approximate it within any constant factor better than \(\frac{4}{3}\) assuming the unique games conjecture. We also show intractability results in the parameterized complexity framework.
Supported by the Indo-German Max Planck Centre for Computer Science Programme in the area of Algebraic and Parameterized Complexity.
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
Abu-Khzama, F.N.: A kernelization algorithm for d-hitting set. Journal of Computer and System Sciences 76(7), 524–531 (2010)
Berge, C.: Färbung von graphen, deren sämtliche bzw. deren ungerade kreise starr sind (zusammenfassung). Wissenschaftliche Zeitschrift, Martin Luther Universität Halle-Wittenberg Mathematisch-Naturwissenschaftliche Reihe 10, 114–115 (1961)
Berry, L.A., Kennedy, W.S., King, A.D., Li, Z., Reed, B.A.: Finding a maximum-weight induced k-partite subgraph of an i-triangulated graph. Discrete Applied Mathematics 158(7), 765–770 (2010)
Cai, L., Juedes, D.: On the existence of subexponential parameterized algorithms. Journal of Computer and System Sciences 67, 789–807 (2003)
Chudnovsky, M., Robertson, N., Seymour, P.D., Thomas, R.: The strong perfect graph theorem. Annals of Mathematics 164(1), 51–229 (2006)
Dell, H., Melkebeek, D.: Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses. In: Proceedings of the ACM Symposium on Theory of Computing, pp. 251–260 (2010)
Dinur, I., Safra, S.: On the hardness of approximating minimum vertex cover. Annals of Mathematics 162(1), 439–485 (2005)
Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs, 2nd edn. Elsevier Science B.V. (2004)
Grötschel, M., Lovász, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer (1988)
Guruswami, V., Lee, E.: Inapproximability of feedback vertex set for bounded length cycles. Electronic Colloquium on Computational Complexity (ECCC) 21, 6 (2014)
Iwata, Y., Oka, K., Yuichi, Y.: Linear-time fpt algorithms via network flow. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pp. 1749–1761 (2014)
Khot, S., Regev, O.: Vertex cover might be hard to approximate to within 2 − ε. Journal of Computer and System Sciences 74(3), 335–349 (2008)
Knuth, D.: The sandwich theorem. Electronic Journal of Combinatorics 1(A1), 1–48 (1994)
Kratsch, S., Wahlström, M.: Compression via matroids: A randomized polynomial kernel for odd cycle transversal. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pp. 94–103 (2012)
Krithika, R., Narayanaswamy, N.S.: Another disjoint compression algorithm for odd cycle transversal. Information Processing Letters 113(22–24), 849–851 (2013)
Krithika, R., Narayanaswamy, N.S.: Parameterized algorithms for (r,l)-partization. Journal of Graph Algorithms and Applications 17(2), 129–146 (2013)
Lokshtanov, D., Narayanaswamy, N.S., Raman, V., Ramanujan, M.S., Saurabh, S.: Faster parameterized algorithms using linear programming. CoRR abs/1203.0833. A preliminary version appeared in the Proceedings of STACS (2012)
Lovász, L.: On minimax theorems of combinatorics. Ph.D thesis, Matemathikai Lapok 26, 209–264 (1975)
Nemhauser, G.L., Trotter, L.E.: Properties of vertex packing and independence system polyhedra. Mathematical Programming 6(1), 48–61 (1974)
Nemhauser, G.L., Trotter, L.E.: Vertex packings: Structural properties and algorithms. Mathematical Programming 8(1), 232–248 (1975)
Reed, B.A., Smith, K., Vetta, A.: Finding odd cycle transversals. Operations Research Letters 32, 299–301 (2004)
Wagler, A.: Critical and anticritical edges in perfect graphs. In: Brandstädt, A., Van Le, B. (eds.) WG 2001. LNCS, vol. 2204, pp. 317–327. Springer, Heidelberg (2001)
Wahlström, M.: Half-integrality, lp-branching and fpt algorithms. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pp. 1762–1781 (2014)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fiorini, S., Krithika, R., Narayanaswamy, N.S., Raman, V. (2014). LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs. In: Schulz, A.S., Wagner, D. (eds) Algorithms - ESA 2014. ESA 2014. Lecture Notes in Computer Science, vol 8737. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44777-2_36
Download citation
DOI: https://doi.org/10.1007/978-3-662-44777-2_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44776-5
Online ISBN: 978-3-662-44777-2
eBook Packages: Computer ScienceComputer Science (R0)