13 citations · 24 across the 24 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2010
On the approximability of robust spanning tree problems
Adam Kasperski, Pawel Zielinski
In this paper the minimum spanning tree problem with uncertain edge costs is discussed. In order to model the uncertainty a discrete scenario set is specified and a robust framewor…
cs.CC2008★ 2 cited
On the approximability of minmax (regret) network optimization problems
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…