Steepest ascent can be exponential in bounded treewidth problems

by   David A. Cohen, et al.

We investigate the complexity of local search based on steepest ascent. We show that even when all variables have domains of size two and the underlying constraint graph (graph of variable interactions) has bounded treewidth (in our construction, treewidth is 7), there are fitness landscapes for which an exponential number of steps may be required to reach a local optimum. This is an improvement on prior recursive constructions of long steepest ascents, which we prove to need constraint graphs of unbounded treewidth.


page 1

page 2

page 3

page 4


The size Ramsey number of graphs with bounded treewidth

A graph G is Ramsey for a graph H if every 2-colouring of the edges of G...

Feedback vertex sets in (directed) graphs of bounded degeneracy or treewidth

We study the minimum size f of a feedback vertex set in directed and und...

Representing fitness landscapes by valued constraints to understand the complexity of local search

Local search is widely used to solve combinatorial optimisation problems...

Approximating MAP using Local Search

MAP is the problem of finding a most probable instantiation of a set of ...

Convex Relaxations for Learning Bounded Treewidth Decomposable Graphs

We consider the problem of learning the structure of undirected graphica...

Advances in Learning Bayesian Networks of Bounded Treewidth

This work presents novel algorithms for learning Bayesian network struct...

Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation

The notion of treewidth, introduced by Robertson and Seymour in their se...

Please sign up or login with your details

Forgot password? Click here to reset