Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2605.12425

Binary constraints on one additional variable can create exponential ascents for local search

David A. Cohen·Peter G. Jeavons·Artem Kaznatcheev·Melle van Marle·Sofia Vazquez Alferez
View original source ↗Read source document ↗Export metadata ↓

Abstract

Local search in combinatorial optimisation can be viewed as an uphill climb on a corresponding fitness landscape, where the assignments visited by a strict local search follow an ascent. This hill-climbing is sometimes surprisingly efficient, but not always. Since fitness landscapes can be succinctly represented by Boolean valued constraint satisfaction problems (VCSPs), we ask: what properties of VCSPs ensure that all ascents are polynomial? Or alternatively, what are the "simplest" VCSPs with exponential ascents? Prior examples of VCSPs with exponential ascents were built up as a chain of gadgets of constraints. Here we investigate what happens for simpler starlike graphs. To establish lower bounds on the \emph{longest} ascent, we construct: (1) a star of binary constraints with a quadratic longest ascent, (2) a binary VCSP of treedepth 3 on 4n + 1 Boolean variables (made by gluing 2n triangles of constraints at a common centre variable) with an exponential longest ascent of length $10\cdot2^n - 9$, and (3) starlike VCSP of logarithmic vertex cover number with an exponential longest ascent. For steepest ascent, we prove (4) a tight bound of 2(n - 1) for VCSPs with star constraint graphs, and construct (5) a starlike tree VCSP with treedepth 3 with a quadratic steepest ascent. Finally, we prove upper bounds on the shortest ascent from any initial assignment: (6) linear for VCSPs of treedepth 3; and (7) $O(2^k (n - k))$ for VCSPs of vertex cover number k. Together (2) and (6) establish treedepth 3, and (3) and (7) establish logarithmic vertex cover number, as the first structural graph parameters for which the longest and shortest ascents can be exponentially separated. We discuss the consequences of our results for the parameterized complexity of local search.

Explore related subjects

cs.DM

Keep this discovery

BibTeXRIS

David A. Cohen, Peter G. Jeavons, Artem Kaznatcheev, Melle van Marle, Sofia Vazquez Alferez. 2026-05-12. Binary constraints on one additional variable can create exponential ascents for local search. https://arxiv.org/abs/2605.12425

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

An FPTAS for Two-Machine Open-Shop Scheduling with a Single Unavailability Interval

We consider the two-machine open-shop scheduling problem in which one machine is unavailable during a fixed interval. We study the resumable setting: an operation interrupted by the unavailability interval may resume, without penalty, when the machine becomes available. The objective is to minimize the makespan. Although the problem is NP-hard and several approximation algorithms are known, whether it admits a fully polynomial-time approximation scheme (FPTAS) has remained open for two decades. We resolve this question affirmatively by giving the first FPTAS, thereby strengthening the previously known polynomial-time approximation scheme (PTAS). As an intermediate result, we develop a new pseudo-polynomial dynamic program with seven state dimensions, improving on the ten-dimensional formulation in the literature.

cs.DM↗
arXiv2026

Generalized Graph Search Trees

Graph search algorithms and their corresponding graph search trees are commonly used in algorithmic graph theory. In recent years, the recognition problem of these graph search trees has received significant attention. So far, the research has focused on two types of search trees: first-in trees that behave like BFS-trees and last-in trees that behave like DFS-trees. The search tree paradigms differ from each other by the parent a vertex is connected to. In first-in trees, it is the first visited neighbor, while in last-in trees it is the last neighbor visited before that vertex. Here, we will generalize these concepts of graph search trees by allowing every preceding neighbor of a vertex to be the parent. We study the complexity of the recognition problem of these generalized graph search trees. We present NP-completeness proofs for most searches. We also show that the problem is trivial for Generic Search and polynomial-time solvable for several searches on bipartite graphs and chordal graphs. We also study the question how fixing the start vertex influences the complexity of the problem.

cs.DM↗
arXiv2026

The exact asymptotic constant in the metric dimension of Jaccard space

Let $X$ be a finite set with $|X|=n$ and let $\mathrm{Jac}(a,b)=|a\,\triangle\, b|/|a\cup b|$ be the Jaccard distance on the power set $2^X$. Lladser and Paradise recently proved that the metric dimension of $(2^X,\mathrm{Jac})$ is $\Theta(n/\ln n)$, with the constant left open; their bounds are $(\ln 2)\,n/\ln n\lesssim \beta(2^X,\mathrm{Jac})\lesssim 2\ln(2e)\,n/\ln n$. We determine the constant: \[ \beta(2^X,\mathrm{Jac})=\frac{2n}{\log_2 n}\,(1+o(1))=(2\ln 2)\,\frac{n}{\ln n}\,(1+o(1)). \] The proof identifies the problem, on each ``slice'' of subsets of fixed cardinality, with the Erd\H{o}s--R\'enyi coin-weighing problem for a spring scale (the problem of \emph{detecting matrices}). The lower bound is the Erd\H{o}s--R\'enyi entropy argument applied to the middle slice; the upper bound follows from the explicit detecting families of Lindstr\"om and of Cantor and Mills, augmented by a single extra landmark that reveals cardinality.

cs.DM↗