Treffer: INAPPROXIMABILITY OF H-TRANSVERSAL/PACKING.

Given an undirected graph G = (V<subscript>G</subscript>,E<subscript>G</subscript>) and a fixed "pattern" graph H = (V<subscript>H</subscript>,E<subscript>H</subscript>) with k vertices, we consider the H-Transversal and H-Packing problems. The former asks to find the smallest S ⊆ V<subscript>G</subscript> such that the subgraph induced by V<subscript>G</subscript> \ S does not have H as a subgraph, and the latter asks to find the maximum number of pairwise disjoint k-subsets S<subscript>1</subscript>,...,S<subscript>m</subscript> ⊆ V<subscript>G</subscript> such that the subgraph induced by each S<subscript>i</subscript> 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 Ω(k) and Ω(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. [ABSTRACT FROM AUTHOR]

Copyright of SIAM Journal on Discrete Mathematics is the property of Society for Industrial & Applied Mathematics and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)