Kernelization for Partial Vertex Cover via (Additive) Expansion Lemma

11/13/2022
by   Tomohiro Koana, et al.
0

Given a graph and two integers k and ℓ, Partial Vertex Cover asks for a set of at most k vertices whose deletion results in a graph with at most ℓ edges. Based on the expansion lemma, we provide a problem kernel with (ℓ + 2)(k + ℓ) vertices. We then introduce a new, additive version of the expansion lemma and show it can be used to prove a kernel with (ℓ + 1)(k + ℓ) vertices for ℓ≥ 1.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/18/2022

A quadratic-order problem kernel for the traveling salesman problem parameterized by the vertex cover number

The NP-hard graphical traveling salesman problem (GTSP) is to find a clo...
research
11/10/2021

Generating faster algorithms for d-Path Vertex Cover

For a constant d, the d-Path Vertex Cover problem (d-PVC) is as follows:...
research
01/14/2022

Covering Many (or Few) Edges with k Vertices in Sparse Graphs

We study the following two fixed-cardinality optimization problems (a ma...
research
11/18/2020

A Deterministic Hitting-Time Moment Approach to Seed-set Expansion over a Graph

We introduce HITMIX, a new technique for network seed-set expansion, i.e...
research
12/26/2022

On linear-algebraic notions of expansion

A fundamental fact about bounded-degree graph expanders is that three no...
research
06/07/2018

Partial vertex covers and the complexity of some problems concerning static and dynamic monopolies

Let G be a graph and τ be an assignment of nonnegative integer threshold...
research
09/22/2022

Online Ridesharing with Meeting Points [Technical Report]

Nowadays, ridesharing becomes a popular commuting mode. Dynamically arri...

Please sign up or login with your details

Forgot password? Click here to reset