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...

Full description

Saved in:

Bibliographic Details
Published in:	Mathematical programming Vol. 149; no. 1-2; pp. 167 - 194
Main Authors:	Golovin, Daniel, Goyal, Vineet, Polishchuk, Valentin, Ravi, R., Sysikaski, Mikko
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.02.2015 Springer Nature B.V
Subjects:	Algorithms Analysis Approximation Calculus of Variations and Optimal Control; Optimization Combinatorial analysis Combinatorics Costs Full Length Paper Mathematical analysis Mathematical and Computational Physics Mathematical Methods in Physics Mathematical programming Mathematics Mathematics and Statistics Mathematics of Computing Numerical Analysis Optimization Prunes Robust optimization – Combinatorial optimization – Approximation algorithms Shortest-path problems Stochasticity Strategy Studies Texts Theoretical Uncertainty Approximation algorithms 90C59 90C15 Robust optimization 90C27 Combinatorial optimization
ISSN:	0025-5610, 1436-4646
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!