1 paper
Anupam Gupta, Marco Molinaro, Matteo Russo
In the random-order online set cover problem, the instance with m sets and n elements is chosen in a worst-case fashion, but then the elements arrive in a uniformly random orde…