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

by   Tomohiro Koana, et al.

We study the following two fixed-cardinality optimization problems (a maximization and a minimization variant). For a fixed α between zero and one we are given a graph and two numbers k ∈ℕ and t ∈ℚ. The task is to find a vertex subset S of exactly k vertices that has value at least (resp. at most for minimization) t. Here, the value of a vertex set computes as α times the number of edges with exactly one endpoint in S plus 1-α times the number of edges with both endpoints in S. These two problems generalize many prominent graph problems, such as Densest k-Subgraph, Sparsest k-Subgraph, Partial Vertex Cover, and Max (k,n-k)-Cut. In this work, we complete the picture of their parameterized complexity on several types of sparse graphs that are described by structural parameters. In particular, we provide kernelization algorithms and kernel lower bounds for these problems. A somewhat surprising consequence of our kernelizations is that Partial Vertex Cover and Max (k,n-k)-Cut not only behave in the same way but that the kernels for both problems can be obtained by the same algorithms.



page 7

page 9

page 11

page 13

page 19

page 23

page 33

page 37


Sparse universal graphs for planarity

We show that for every integer n≥ 1 there exists a graph G_n with (1+o(1...

A new lower bound for eternal vertex cover number

We obtain a new lower bound for the eternal vertex cover number of an ar...

A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs

Subexponential parameterized algorithms are known for a wide range of na...

Minimum T-Joins and Signed-Circuit Covering

Let G be a graph and T be a vertex subset of G with even cardinality. A ...

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...

Max-Cut in Degenerate H-Free Graphs

We obtain several lower bounds on the Max-Cut of d-degenerate H-free gra...

On Happy Colorings, Cuts, and Structural Parameterizations

We study the Maximum Happy Vertices and Maximum Happy Edges problems. Th...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.