arXiv cs.NE
· Papers
Local search for valued constraint satisfaction parameterized by treedepth
arXiv:2405.12410v2 Announce Type: replace-cross Abstract: Sometimes local search algorithms cannot efficiently find even local peaks. To understand why, I look at the structure of ascents in fitness landscapes from valued constraint satisfaction problems (VCSPs) parameterized by the treedepth of their constraint graphs