2 citations · 2 across the 1 of their papers we have counts for
1 paper · 1 filter
Adam Kasperski, Pawel Zielinski
In this paper the minmax (regret) versions of some basic polynomially solvable deterministic network problems are discussed. It is shown that if the number of scenarios is unbounde…