Showing cs.DSShow all
2 papers · 1 filter
cs.DS2024
When is local search both effective and efficient?
Artem Kaznatcheev, Sofia Vazquez Alferez
Combinatorial optimization problems implicitly define fitness landscapes that combine the numeric structure of the 'fitness' function to be maximized with the combinatorial structu…
cs.DS2024
Destroying Densest Subgraphs is Hard
Cristina Bazgan, André Nichterlein, Sofia Vazquez Alferez
We analyze the computational complexity of the following computational problems called Bounded-Density Edge Deletion and Bounded-Density Vertex Deletion: Given a graph , a budge…