Bridge-Depth Characterizes Which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel.
Marin BougeretBart M. P. JansenIgnasi SauPublished in: ICALP (2020)
Keyphrases
- vertex cover
- polynomial kernels
- approximation algorithms
- gaussian kernels
- support vector machine
- kernel function
- planar graphs
- partial order
- precedence constraints
- special case
- linearly separable
- optimality criterion
- worst case
- support vector
- np hard
- upper bound
- reproducing kernel hilbert space
- polynomial time approximation
- lower bound