2 papers
cs.LG2026
On the Slow Convergence to Trivial Solutions of Algorithms for Hard Optimization Problems
Ali Hussaini Umar, Jean Barbier, Matthieu Jonckheere +1
Hard combinatorial optimization problems, many of which are NP-hard, present fundamental algorithmic challenges. Average-case analysis on random instances has emerged as a powerful…
math.PR2020
Sequential Algorithms and Independent Sets Discovering on Large Sparse Random Graphs
Paola Bermolen, Matthieu Jonckheere, Federico Larroca +1
Computing the size of maximum independent sets is a NP-hard problem for fixed graphs. Characterizing and designing efficient algorithms to estimate this independence number for ran…