DUGi

Exponential steepest ascent from valued constraint graphs of pathwidth four

http://dugi.udg.edu/item/http:@@@@hdl.handle.net@@10256.1@@7779

Melle van Marle from the University of Utrecht, Holland, tells us about the complexity of maximising fitness via local search on valued constraint satisfaction problems (VCSPs). We consider two kinds of local ascents: (1) steepest ascents, where each step changes the domain that produces a maximal increase in fitness; and(2) $\prec$-ordered ascents, where -- of the domains with available fitness increasing changes -- each step changes the $\prec$-minimal domain. We provide a general padding argument to simulate any ordered ascent by a steepest ascent. We construct a VCSP that is a path of binary constraints between alternating 2-state and 3-state domains with exponentially long ordered ascents. We apply our padding argument to this VCSP to obtain a Boolean VCSP that has a constraint (hyper)graph of arity 5 and pathwidth 4 with exponential steepest ascents. This is an improvement on the previous best known construction for long steepest ascents, which had arity 8 and pathwidth 7

7779.mp4 7779.mp3

Universitat de Girona. Departament d’Informàtica, Matemàtica Aplicada i Estadística