Showing 2025Show all
2 papers · 1 filter
cs.DM2025
Greed is slow on sparse graphs of oriented valued constraints
Artem Kaznatcheev, Sofia Vazquez Alferez
Greedy local search is especially popular for solving valued constraint satisfaction problems (VCSPs). Since any method will be slow for some VCSPs, we ask: what is the simplest VC…
q-bio.PE2025
A strengthened bound on the number of states required to characterize maximum parsimony distance
Mareike Fischer, Steven Kelk, Sofia Vazquez Alferez
In this article we prove that the distance between two unrooted binary phylogenetic trees on the same set of taxa can be defined by a char…