1 paper · 1 filter
Klaus Jansen, Tobias Mömke, Björn Schumacher
We study hardness of reoptimization of the fundamental and hard to approximate SetCover problem. Reoptimization considers an instance together with a solution and a modified instan…