|
|||||
|
|
Improved approximations for two-stage min-cut and shortest path problems under uncertainty |
|
| Authors: | Golovin Daniel Goyal Vineet Polishchuk Valentin Ravi R Sysikaski Mikko |
| Institution: | 1.Google, Pittsburgh, PA, USA ;2.Google, Zurich, Switzerland ;3.Department of Industrial Engineering and Operations Research, Columbia University, Upper Manhattan, NY, USA ;4.Department of Computer Science, Helsinki Institute for Information Technology, University of Helsinki, Helsinki, Finland ;5.Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA, USA ; |
| Abstract: | Mathematical Programming - 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... |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |