Improved approximations for two-stage min-cut and shortest path problems under uncertainty

In this paper, we study the robust and stochastic versions of the two-stage min-cut and shortest path problems introduced in Dhamdhere et al. (in How to pay, come what may: approximation algorithms for demand-robust covering problems. In: FOCS, pp 367–378,  2005 ), and give approximation algorithms...

Ausführliche Beschreibung