Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

18

Voted
APPROX

2015

Springer

2015

Springer

Given an undirected graph G = (VG, EG) and a ﬁxed pattern graph H = (VH , EH ) with k vertices, we consider the H-Transversal and H-Packing problems. The former asks to ﬁnd the smallest S ⊆ VG such that the subgraph induced by VG \ S does not have H as a subgraph, and the latter asks to ﬁnd the maximum number of pairwise disjoint k-subsets S1, ..., Sm ⊆ VG 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 Ω(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

Added |
16 Apr 2016 |

Updated |
16 Apr 2016 |

Type |
Journal |

Year |
2015 |

Where |
APPROX |

Authors |
Venkatesan Guruswami, Euiwoong Lee |

Comments (0)