Document Open Access Logo

Inapproximability of H-Transversal/Packing

Authors Venkatesan Guruswami, Euiwoong Lee

PDF

File

Thumbnail PDF
PDF
LIPIcs.APPROX-RANDOM.2015.284.pdf
  • Filesize: 0.69 MB
  • 21 pages

Document Identifiers

Subject Classification

Keywords
  • Constraint Satisfaction Problems
  • Approximation resistance

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

Given an undirected graph G=(V,E) and a fixed pattern graph H with k vertices, we consider the H-Transversal and H-Packing problems. The former asks to find the smallest subset S of vertices such that the  subgraph induced by V - S does not have H as a subgraph, and the latter asks to find the maximum number of pairwise disjoint k-subsets S1, ..., Sm such that the subgraph induced by each Si has H as a subgraph.

We prove that if H is 2-connected, H-Transversal and H-Packing are almost as hard to approximate as general k-Hypergraph Vertex Cover and k-Set Packing, so it is NP-hard to approximate them within a factor of Omega(k) and Omega(k / polylog(k)) respectively. We also show that there is a 1-connected H where H-Transversal admits an O(log k)-approximation algorithm, so that the connectivity requirement cannot be relaxed from 2 to 1. For a special case of H-Transversal where H is a (family of) cycles, we mention the implication of our result to the related Feedback Vertex Set problem, and give a different hardness proof for directed graphs.

Cite As Get BibTex

Venkatesan Guruswami and Euiwoong Lee. Inapproximability of H-Transversal/Packing. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 40, pp. 284-304, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015) https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.284

Author Details

Venkatesan Guruswami
Euiwoong Lee

References

  1. Matthew Andrews, Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar, and Lisa Zhang. Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs. Combinatorica, 30(5):485-520, 2010. Google Scholar
  2. Matthew Andrews and Lisa Zhang. Logarithmic hardness of the undirected edge-disjoint paths problem. Journal of the ACM, 53(5):745-761, 2006. Google Scholar
  3. P. Austrin, S. Khot, and M. Safra. Inapproximability of vertex cover and independent set in bounded degree graphs. In Proceedings of the 24th annual IEEE Conference on Computational Complexity, CCC'09, pages 74-80, 2009. Google Scholar
  4. V. Bafna, P. Berman, and T. Fujito. Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs. In Proceedings of the 6th International Symposium on Algorithms and Computation, ISAAC'95, pages 142-151, 1995. Google Scholar
  5. N. Bansal and S. Khot. Inapproximability of hypergraph vertex cover and applications to scheduling problems. In Proceedings of the 37th International Colloquium on Automata, Languages and Programming, ICALP'10, pages 250-261, 2010. Google Scholar
  6. R. Bar-Yehuda, D. Geiger, J. Naor, and R. Roth. Approximation algorithms for the feedback vertex set problem with applications to constraint satisfaction and bayesian inference. SIAM Journal on Computing, 27(4):942-959, 1998. Google Scholar
  7. A. Becker and D. Geiger. Optimization of Pearl’s method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem. Artificial Intelligence, 83(1):167-188, 1996. Google Scholar
  8. H. L. Bodlaender. On disjoint cycles. International Journal of Foundations of Computer Science, 5(01):59-68, 1994. Google Scholar
  9. A. Brandstädt, V. Chepoi, and F. Dragan. Clique r-domination and clique r-packing problems on dually chordal graphs. SIAM J. on Discrete Mathematics, 10(1):109-127, 1997. Google Scholar
  10. Parinya Chalermsook, Bundit Laekhanukit, and Danupon Nanongkai. Pre-reduction graph products: Hardnesses of properly learning DFAs and approximating EDP on DAGs. In Proc. of the 55rd Annual Symp. on Foundations of Computer Science (FOCS'14). IEEE, 2014. Google Scholar
  11. S. Chan. Approximation resistance from pairwise independent subgroups. In Proc. of the 45th Annual ACM Symp. on Symposium on Theory of Computing, STOC'13, pages 447-456, 2013. Google Scholar
  12. Maw-Shang Chang, Ton Kloks, and Chuan-Min Lee, editors. Graph-Theoretic Concepts in Computer Science, volume 2204 of Lecture Notes in Computer Science. Springer, 2001. Google Scholar
  13. F. Chataigner, G. Manić, Y. Wakabayashi, and R. Yuster. Approximation algorithms and hardness results for the clique packing problem. Discrete Applied Mathematics, 157(7):1396-1406, 2009. Google Scholar
  14. J. Chen, Y. Liu, S. Lu, B. O’sullivan, and I. Razgon. A fixed-parameter algorithm for the directed feedback vertex set problem. Journal of the ACM, 55(5):21:1-21:19, 2008. Google Scholar
  15. R. Chitnis, M. Cygan, M. Hajiaghayi, and D. Marx. Directed subset feedback vertex set is fixed-parameter tractable. In Proceedings of the 39th International Colloquium on Automata, Languages, and Programming, ICALP'12, pages 230-241, 2012. Google Scholar
  16. Miroslav Chlebík and Janka Chlebíková. Approximation hardness of dominating set problems in bounded degree graphs. Information and Computation, 206(11):1264-1275, 2008. Google Scholar
  17. F. A. Chudak, M. X. Goemans, D. S. Hochbaum, and D. P. Williamson. A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs. Operations Research Letters, 22(4–5):111-118, 1998. Google Scholar
  18. M. Cygan, M. Pilipczuk, M. Pilipczuk, and J. O. Wojtaszczyk. Subset feedback vertex set is fixed-parameter tractable. In Proceedings of the 38th International Colloquim on Automata, Languages and Programming, ICALP'11, pages 449-461, 2011. Google Scholar
  19. Marek Cygan. Improved approximation for 3-dimensional matching via bounded pathwidth local search. In Proceedings of the 54th annual IEEE symposium on Foundations of Computer Science, FOCS'13, pages 509-518, 2013. Google Scholar
  20. I. Dinur and S. Safra. On the hardness of approximating minimum vertex cover. Annals of Mathematics, pages 439-485, 2005. Google Scholar
  21. Irit Dinur, Venkatesan Guruswami, Subhash Khot, and Oded Regev. A new multilayered PCP and the hardness of hypergraph vertex cover. SIAM Journal on Computing, 34(5):1129-1146, 2005. Google Scholar
  22. D. Dor and M. Tarsi. Graph decomposition is NP-complete: A complete proof of Holyer’s conjecture. SIAM Journal on Computing, 26(4):1166-1187, 1997. Google Scholar
  23. Guillermo Durán, Min Chih Lin, Sergio Mera, and Jayme L Szwarcfiter. Algorithms for finding clique-transversals of graphs. Annals of Operations Research, 157(1):37-45, 2008. Google Scholar
  24. Paul Erdős, Tibor Gallai, and Zsolt Tuza. Covering the cliques of a graph with vertices. Discrete Mathematics, 108(1):279-289, 1992. Google Scholar
  25. G. Even, J. Naor, S. Rao, and B. Schieber. Divide-and-conquer approximation algorithms via spreading metrics. Journal of the ACM, 47(4):585-616, 2000. Google Scholar
  26. G. Even, J. Naor, B. Schieber, and M. Sudan. Approximating minimum feedback sets and multicuts in directed graphs. Algorithmica, 20:151-174, 1998. Google Scholar
  27. Tomas Feder and Carlos Subi. Packing edge-disjoint triangles in given graphs. Electronic Colloquium on Computational Complexity (ECCC), 2012. TR12-013. Google Scholar
  28. Z. Friggstad and M. R. Salavatipour. Approximability of packing disjoint cycles. In Proc. of the 18th Int'l Conf. on Algorithms and Computation, ISAAC'07, pages 304-315, 2007. Google Scholar
  29. V. Guruswami, R. Manokaran, and P. Raghavendra. Beating the random ordering is hard: Inapproximability of maximum acyclic subgraph. In Proceedings of the 49th annual IEEE symposium on Foundations of Computer Science, FOCS'08, pages 573-582, 2008. Google Scholar
  30. Venkatesan Guruswami and Euiwoong Lee. Inapproximability of feedback vertex set for bounded length cycles. Electronic Colloquium on Computational Complexity (ECCC), TR 14-006, 2014. Google Scholar
  31. Venkatesan Guruswami and Euiwoong Lee. Inapproximability of H-transversal/matching. arXiv preprint arXiv:1506.06302, 2015. Google Scholar
  32. Venkatesan Guruswami and C. Pandu Rangan. Algorithmic aspects of clique-transversal and clique-independent sets. Discrete Applied Mathematics, 100(3):183-202, 2000. Google Scholar
  33. Venkatesan Guruswami, C. Pandu Rangan, M. S. Chang, G. J. Chang, and C. K. Wong. The K_r-packing problem. Computing, 66(1):79-89, 2001. Google Scholar
  34. Elad Hazan, Shmuel Safra, and Oded Schwartz. On the complexity of approximating k-set packing. Computational Complexity, 15(1):20-39, 2006. Google Scholar
  35. P. Hell, S. Klein, L.T. Nogueira, and F. Protti. Packing r-cliques in weighted chordal graphs. Annals of Operations Research, 138(1):179-187, 2005. Google Scholar
  36. Bart M. P. Jansen and Dániel Marx. Characterizing the easy-to-find subgraphs from the viewpoint of polynomial-time algorithms, kernels, and turing kernels. In Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 616-629, 2015. Google Scholar
  37. Subhash Khot. On the power of unique 2-prover 1-round games. In Proceedings of the 34th annual ACM Symposium on Theory of Computing, STOC'02, pages 767-775, 2002. Google Scholar
  38. Subhash Khot and Oded Regev. Vertex cover might be hard to approximate to within 2-ε. Journal of Computer and System Sciences, 74(3):335-349, 2008. Google Scholar
  39. D. Kirkpatrick and P. Hell. On the complexity of general graph factor problems. SIAM Journal on Computing, 12(3):601-609, 1983. Google Scholar
  40. Ton Kloks. Packing interval graphs with vertex-disjoint triangles. arXiv preprint arXiv:1202.1041, 2012. Google Scholar
  41. Guy Kortsarz, Michael Langberg, and Zeev Nutov. Approximating maximum subgraphs without short cycles. SIAM Journal on Discrete Mathematics, 24(1):255-269, 2010. Google Scholar
  42. M. Krivelevich, Z. Nutov, M. R. Salavatipour, J. V. Yuster, and R. Yuster. Approximation algorithms and hardness results for cycle packing problems. ACM Transactions on Algorithms, 3(4), November 2007. Google Scholar
  43. Chuan-Min Lee. Weighted maximum-clique transversal sets of graphs. ISRN Discrete Mathematics, 2011, 2012. Google Scholar
  44. CM Lee, MS Chang, and SC Sheu. The clique transversal and clique independence of distance hereditary graphs. In Proceedings of the 19th Workshop on Combinatorial Mathematics and Computation Theory, Taiwan, pages 64-69, 2002. Google Scholar
  45. Carsten Lund and Mihalis Yannakakis. The approximation of maximum subgraph problems. In Automata, Languages and Programming, volume 700 of Lecture Notes in Computer Science, pages 40-51. Springer, 1993. Google Scholar
  46. Sridhar Rajagopalan and Vijay V. Vazirani. Primal-dual rnc approximation algorithms for set cover and covering integer programs. SIAM J. on Computing, 28(2):525-540, 1998. Google Scholar
  47. Dieter Rautenbach and Friedrich Regen. On packing shortest cycles in graphs. Information Processing Letters, 109(14):816-821, 2009. Google Scholar
  48. P. D. Seymour. Packing directed circuits fractionally. Combinatorica, 15(2):281-288, 1995. Google Scholar
  49. Erfang Shan, Zuosong Liang, and Liying Kang. Clique-transversal sets and clique-coloring in planar graphs. European Journal of Combinatorics, 36:367-376, 2014. Google Scholar
  50. Ola Svensson. Hardness of vertex deletion and project scheduling. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, volume 7408 of Lecture Notes in Computer Science, pages 301-312. Springer, 2012. Google Scholar
  51. Zsolt Tuza. Covering all cliques of a graph. In S.T. Hedetniemi, editor, Topics on Domination, volume 48 of Annals of Discrete Mathematics, pages 117-126. Elsevier, 1991. Google Scholar
  52. R. Yuster. Edge-disjoint cliques in graphs with high minimum degree. SIAM Journal on Discrete Mathematics, 28(2):893-910, 2014. Google Scholar
  53. Raphael Yuster. Combinatorial and computational aspects of graph packing and graph decomposition. Computer Science Review, 1(1):12-26, 2007. Google Scholar
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact