Hitting Set in hypergraphs of low VC-dimension

@inproceedings{Bringmann2016HittingSI,
  title={Hitting Set in hypergraphs of low VC-dimension},
  author={Karl Bringmann and L{\'a}szl{\'o} Kozma and Shay Moran and N. Narayanaswamy},
  booktitle={ESA},
  year={2016}
}
We study the complexity of the Hitting Set problem in set systems (hypergraphs) that avoid certain sub-structures. In particular, we characterize the classical and parameterized complexity of the problem when the Vapnik-Chervonenkis dimension (VC-dimension) of the input is small. VC-dimension is a natural measure of complexity of set systems. Several tractable instances of Hitting Set with a geometric or graph-theoretical flavor are known to have low VC-dimension. In set systems of bounded VC… 
View PDF on arXiv
13 Citations
Background Citations
7

Figures and Tables from this paper

13 Citations

Citation Type

Citation Type

Parameterized and approximation complexity of Partial VC Dimension
Vapnik-Chervonenkis dimension and density on Johnson and Hamming graphs
On the Effectiveness of Data Reduction for Covering Problems in Real-World Transit Networks
  • 2018
Given a graph and a set of paths, we want to find the minimal set of vertices such that each path is covered by at least one chosen vertex. Although this problem is NP-hard, real-world instances can…
On the Approximability of Partial VC Dimension
TLDR
The associated fixed-cardinality maximization problem Max Partial VC Dimension that aims at maximizing the number of equivalence classes induced by a solution set of k vertices is introduced.
Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions)
TLDR
The main hardness result is a matching lower bound for the algorithm, and it is shown that planar SCSS does not have an f(k) · no(√k) algorithm for any computable function f, unless the Exponential Time Hypothesis (ETH) fails.
Long paths make pattern-counting hard, and deep trees make it harder
TLDR
It is shown that if C is one of the so-called monotone grid classes, and C has the LPP but not the DTP, then C -Pattern #PPM can be solved in time f ( k ) n O ( √ k ) .
Complexity of Permutation Pattern Matching
Permutation pattern matching (PPM) is the problem of determining whether a permutation π is contained in another permutation τ , i.e. τ has a subsequence that is order-isomorphic to π. We study the…
Optimal Discretization is Fixed-parameter Tractable
TLDR
The result answers in positive a question of Bonnet, Giannopolous, and Lampis and of Froese and is in contrast with the known intractability of two closely related generalizations: the Rectangle Stabbing problem and the generalization in which the selected lines are not required to be axis-parallel.
Tight Kernels for Covering and Hitting: Point Hyperplane Cover and Polynomial Point Hitting Set
TLDR
This paper focuses on the D-Polynomial Points Hitting Set problem, where k is the parameter, and determines whether there is a set of at most k points in \(\mathbb {R}^d\) that hit all the polynomials in \(\Mathcal {F}\).
Finding and counting permutations via CSPs
TLDR
Two new algorithms are given for permutation patterns and pattern avoidance, one whose running time is the better of the jats:inline-formula and the other a polynomial-space algorithm.
...
...

References

SHOWING 1-10 OF 53 REFERENCES
Hitting sets when the VC-dimension is small
Almost optimal set covers in finite VC-dimension
We give a deterministic polynomial-time method for finding a set cover in a set system (X, ℛ) of dual VC-dimensiond such that the size of our cover is at most a factor ofO(d log(dc)) from the optimal…
Near-Linear Algorithms for Geometric Hitting Sets and Set Covers
TLDR
Two simple algorithms, based on the multiplicative-weight method, for computing a small-size hitting set or set cover of Σ are presented, a simpler variant of the Brönnimann-Goodrich algorithm but more efficient to implement and can be viewed as solving a two-player zero-sum game.
Identifying Codes in Hereditary Classes of Graphs and VC-Dimension
TLDR
It is shown that the problem of finding a smallest identifying code in a given graph from some class is log-APX-hard for any hereditary class of infinite VC-dimension and it is proved that it can be approximate within a factor 6 for interval graphs.
FPT Algorithms for Domination in Biclique-Free Graphs
TLDR
It is shown that various domination problems are fixed-parameter tractable on biclique-free classes of graphs, when parameterizing by both solution size and t.
Exact algorithms and applications for Tree-like Weighted Set Cover
Sign rank, VC dimension and spectral gaps
TLDR
The maximum possible sign rank of N×N sign matrices with a given VC dimension d is studied, and it is proved that its sign rank is larger than N 1 2 − 1 2d .
Domination When the Stars Are Out
TLDR
It is shown that Dominating Set on claw-free graphs is (i) fixed-parameter tractable and (ii) even possesses a polynomial kernel.
Parameterized Complexity of Stabbing Rectangles and Squares in the Plane
TLDR
It is shown that Rectangle Stabbing is fixed-parameter tractable in the still NP-hard case where both these restrictions apply, and the parameterized complexity of the special case where the input consists of rectangles that do not overlap is open.
Compressing and Teaching for Low VC-Dimension
TLDR
This work shows that given an arbitrary set of labeled examples from an unknown concept in C, one can retain only a subset of exp(d) of them, in a way that allows to recover the labels of all other examples in the set, using additional exp( d) information bits.
...
...