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

Math. Program., pp. 167-194, 2015.

Cited by: 35|Bibtex|Views4|DOI:https://doi.org/10.1007/s10107-013-0742-0
EI
Other Links: dl.acm.org|dblp.uni-trier.de|academic.microsoft.com|link.springer.com

Abstract:

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 with improved approximation factors. Spe...More

Code:

Data:

Your rating :
0

 

Tags
Comments