Faster algorithm for Unique (k,2)-CSP

10/07/2021
by   Or Zamir, et al.
0

In a (k,2)-Constraint Satisfaction Problem we are given a set of arbitrary constraints on pairs of k-ary variables, and are asked to find an assignment of values to these variables such that all constraints are satisfied. The (k,2)-CSP problem generalizes problems like k-coloring and k-list-coloring. In the Unique (k,2)-CSP problem, we add the assumption that the input set of constraints has at most one satisfying assignment. Beigel and Eppstein gave an algorithm for (k,2)-CSP running in time O((0.4518k)^n) for k>3 and O(1.356^n) for k=3, where n is the number of variables. Feder and Motwani improved upon the Beigel-Eppstein algorithm for k≥ 11. Hertli, Hurbain, Millius, Moser, Scheder and Szedlák improved these bounds for Unique (k,2)-CSP for every k≥ 5. We improve the result of Hertli et al. and obtain better bounds for Unique (k,2)-CSP for k≥ 5. In particular, we improve the running time of Unique (5,2)-CSP from O(2.254^n) to O(2.232^n) and Unique (6,2)-CSP from O(2.652^n) to O(2.641^n).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/07/2018

Tight Lower Bounds for List Edge Coloring

The fastest algorithms for edge coloring run in time 2^m n^O(1), where m...
research
12/27/2018

Complexity of Reconfiguration Problems for Constraint Satisfaction

Constraint satisfaction problem (CSP) is a well-studied combinatorial se...
research
02/04/2000

On the accuracy and running time of GSAT

Randomized algorithms for deciding satisfiability were shown to be effec...
research
12/24/2022

Triplet Reconstruction and all other Phylogenetic CSPs are Approximation Resistant

We study the natural problem of Triplet Reconstruction (also Rooted Trip...
research
08/04/2020

Erratum: Fast and Simple Horizontal Coordinate Assignment

We point out two flaws in the algorithm of Brandes and Köpf (Proc. GD 20...
research
05/22/2020

Algebraic Global Gadgetry for Surjective Constraint Satisfaction

The constraint satisfaction problem (CSP) on a finite relational structu...
research
11/24/2020

Towards the sampling Lovász Local Lemma

Let Φ = (V, 𝒞) be a constraint satisfaction problem on variables v_1,…, ...

Please sign up or login with your details

Forgot password? Click here to reset