1 citations · 1 across the 1 of their papers we have counts for
1 paper
Antoine Lhomme, Olivier Romane, Nicolas Catusse +1
Computing lower and upper bounds on the competitive ratio of online algorithms is a challenging question: For a minimization combinatorial problem, proving a competitive ratio for…