3 research outputs found
Kernelization of Constraint Satisfaction Problems:A Study through Universal Algebra
A kernelization algorithm for a computational problem is a procedure which
compresses an instance into an equivalent instance whose size is bounded with
respect to a complexity parameter. For the Boolean satisfiability problem
(SAT), and the constraint satisfaction problem (CSP), there exist many results
concerning upper and lower bounds for kernelizability of specific problems, but
it is safe to say that we lack general methods to determine whether a given SAT
problem admits a kernel of a particular size. This could be contrasted to the
currently flourishing research program of determining the classical complexity
of finite-domain CSP problems, where almost all non-trivial tractable classes
have been identified with the help of algebraic properties. In this paper, we
take an algebraic approach to the problem of characterizing the kernelization
limits of NP-hard SAT and CSP problems, parameterized by the number of
variables. Our main focus is on problems admitting linear kernels, as has,
somewhat surprisingly, previously been shown to exist. We show that a CSP
problem has a kernel with O(n) constraints if it can be embedded (via a domain
extension) into a CSP problem which is preserved by a Maltsev operation. We
also study extensions of this towards SAT and CSP problems with kernels with
O(n^c) constraints, c>1, based on embeddings into CSP problems preserved by a
k-edge operation, k > c. These results follow via a variant of the celebrated
few subpowers algorithm. In the complementary direction, we give indication
that the Maltsev condition might be a complete characterization of SAT problems
with linear kernels, by showing that an algebraic condition that is shared by
all problems with a Maltsev embedding is also necessary for the existence of a
linear kernel unless NP is included in co-NP/poly
Designing FPT algorithms for cut problems using randomized contractions
We introduce a new technique for designing fixed-parameter algorithms for cut problems, namely randomized contractions. We apply our framework to obtain the first FPT algorithm for the Unique Label Cover problem and new FPT algorithms with exponential speed up for the Steiner Cut and Node Multiway Cut-Uncut problems. More precisely, we show the following: ā¢ We prove that the parameterized version of the Unique Label Cover problem, which is the base of the Unique Games Conjecture, can be solved in 2O(k 2 log |Ī£|)n4 log n deterministic time (even in the stronger, vertex-deletion variant) where k is the number of unsatisfied edges and |Ī£ | is the size of the alphabet. As a consequence, we show that one can in polynomial time solve instances of Unique Games where the number of edges allowed not to be satisfied is upper bounded by O( log n) to optimality, which improves over the trivial O(1) upper bound
Algorithmes exponentiels pour l'Ć©tiquetage, la domination et l'ordonnancement
This manuscript of Habilitation aĢ Diriger des Recherches enlights some results obtained since my PhD, I defended in 2007. The presented results have been mainly published in international conferences and journals. Exponential-time algorithms are given to solve various decision, optimization and enumeration problems. First, we are interested in solving the L(2,1)-labeling problem for which several algorithms are described (based on branching, divide-and-conquer and dynamic programming). Some combinatorial bounds are also established to analyze those algorithms. Then we solve domination-like problems. We develop algorithms to solve a generalization of the dominating set problem and we give algorithms to enumerate minimal dominating sets in some graph classes. As a consequence, the analysis of these algorithms implies combinatorial bounds. Finally, we extend our field of applications of moderately exponential-time algorithms to scheduling problems. By using dynamic programming paradigm and by extending the sort-and-search approach, we are able to solve a family of scheduling problems.Ce manuscrit dāHabilitation aĢ Diriger des Recherches met en lumieĢre quelques reĢsultats obtenus depuis ma theĢse de doctorat soutenue en 2007. Ces reĢsultats ont eĢteĢ, pour lāessentiel, publieĢs dans des confeĢrences et des journaux internationaux. Des algorithmes exponentiels sont donneĢs pour reĢsoudre des probleĢmes de deĢcision, dāoptimisation et dāeĢnumeĢration. On sāinteĢresse tout dāabord au probleĢme dāeĢtiquetage L(2,1) dāun graphe, pour lequel diffeĢrents algorithmes sont deĢcrits (baseĢs sur du branchement, le paradigme diviser-pour-reĢgner, ou la programmation dynamique). Des bornes combinatoires, neĢcessaires aĢ lāanalyse de ces algorithmes, sont eĢgalement eĢtablies. Dans un second temps, nous reĢsolvons des probleĢmes autour de la domination. Nous deĢveloppons des algorithmes pour reĢsoudre une geĢneĢralisation de la domination et nous donnons des algorithmes pour eĢnumeĢrer les ensembles dominants minimaux dans des classes de graphes. Lāanalyse de ces algorithmes implique des bornes combinatoires. Finalement, nous eĢtendons notre champ dāapplications de lāalgorithmique modeĢreĢment exponentielle aĢ des probleĢmes dāordonnancement. Par le deĢveloppement dāapproches de type programmation dynamique et la geĢneĢralisation de la meĢthode trier-et-chercher, nous proposons la reĢsolution de toute une famille de probleĢmes dāordonnancement