Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
Deciding first-order properties of locally tree-decomposable structures
Journal of the ACM (JACM)
Which problems have strongly exponential complexity?
Journal of Computer and System Sciences
On Local Search and Placement of Meters in Networks
SIAM Journal on Computing
A deterministic (2 - 2/(k+ 1))n algorithm for k-SAT based on local search
Theoretical Computer Science
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Stochastic Local Search: Foundations & Applications
Stochastic Local Search: Foundations & Applications
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
On the Hardness of Losing Weight
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Searching the k-change neighborhood for TSP is W[1]-hard
Operations Research Letters
Parameterized Complexity
Constraint satisfaction parameterized by solution size
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
On the hardness of losing weight
ACM Transactions on Algorithms (TALG)
The parameterized complexity of k-flip local search for SAT and MAX SAT
Discrete Optimization
| Hi-index | 0.00 |
Sat and Max Sat are among the most prominent problems for which local search algorithms have been successfully applied. A fundamental task for such an algorithm is to increase the number of clauses satisfied by a given truth assignment by flipping the truth values of at most k variables (k -flip local search). For a total number of n variables the size of the search space is of order n k and grows quickly in k ; hence most practical algorithms use 1-flip local search only. In this paper we investigate the worst-case complexity of k -flip local search, considering k as a parameter: is it possible to search significantly faster than the trivial n k bound? In addition to the unbounded case we consider instances with a bounded number of literals per clause or where each variable occurs in a bounded number of clauses. We also consider the related problem that asks whether we can satisfy all clauses by flipping the truth values of at most k variables.