Inapproximability of H-Transversal/Packing
From MaRDI portal
Publication:5351907
DOI10.4230/LIPIcs.APPROX-RANDOM.2015.284zbMath1375.68059arXiv1506.06302OpenAlexW2736873987MaRDI QIDQ5351907
Euiwoong Lee, Venkatesan Guruswami
Publication date: 31 August 2017
Full work available at URL: https://arxiv.org/abs/1506.06302
Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (6)
Towards a polynomial kernel for directed feedback vertex set ⋮ Kernels for deletion to classes of acyclic digraphs ⋮ Inapproximability of $H$-Transversal/Packing ⋮ Unnamed Item ⋮ Partitioning a graph into small pieces with applications to path transversal ⋮ Parameterised algorithms for deletion to classes of DAGs
This page was built for publication: Inapproximability of H-Transversal/Packing
