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

@article{Golovin2015ImprovedAF,
  title={Improved approximations for two-stage min-cut and shortest path problems under uncertainty},
  author={Daniel Golovin and Vineet Goyal and Valentin Polishchuk and R. Ravi and Mikko Sysikaski},
  journal={Math. Program.},
  year={2015},
  volume={149},
  pages={167-194}
}
In this paper, we study the robust and stochastic versions of the two-stage mincut and shortest path problems introduced in Dhamdhere et al. [6], and give approximation algorithms with improved approximation factors. Specifically, we give a 2-approximation for the robust min-cut problem and a 4-approximation for the stochastic version. For the two-stage shortest path problem, we give a 3.39-approximation for the robust version and 6.78-approximation for the stochastic version. Our results… CONTINUE READING