DeepAI AI Chat
Log In Sign Up

Lower Bounds for the Happy Coloring Problems

by   Ivan Bliznets, et al.

In this paper, we study the Maximum Happy Vertices and the Maximum Happy Edges problems (MHV and MHE for short). Very recently, the problems attracted a lot of attention and were studied in Agrawal '18, Aravind et al. '16, Choudhari and Reddy '18, Misra and Reddy '18. Main focus of our work is lower bounds on the computational complexity of these problems. Established lower bounds can be divided into the following groups: NP-hardness of the above guarantee parameterization, kernelization lower bounds (answering questions of Misra and Reddy '18), exponential lower bounds under the Set Cover Conjecture and the Exponential Time Hypothesis, and inapproximability results. Moreover, we present an O^*(ℓ^k) randomized algorithm for MHV and an O^*(2^k) algorithm for MHE, where ℓ is the number of colors used and k is the number of required happy vertices or edges. These algorithms cannot be improved to subexponential taking proved lower bounds into account.


page 1

page 2

page 3

page 4


Optimal Lower Bounds for Matching and Vertex Cover in Dynamic Graph Streams

In this paper, we give simple optimal lower bounds on the one-way two-pa...

Slicing the hypercube is not easy

We prove that at least Ω(n^0.51) hyperplanes are needed to slice all edg...

Abelian Repetition Threshold Revisited

Abelian repetition threshold ART(k) is the number separating fractional ...

Mono-monostatic polyhedra with uniform point masses have at least 8 vertices

The monostatic property of convex polyhedra (i.e. the property of having...

Comments on the Du-Kakade-Wang-Yang Lower Bounds

Du, Kakade, Wang, and Yang recently established intriguing lower bounds ...

Exact Lower Bounds for Monochromatic Schur Triples and Generalizations

We derive exact and sharp lower bounds for the number of monochromatic g...

Semi-Algebraic Proofs, IPS Lower Bounds and the τ-Conjecture: Can a Natural Number be Negative?

We introduce the binary value principle which is a simple subset-sum ins...