Two-stage robust network design with exponential scenarios
type: Item
instance of: scholarly article
title: Two-stage robust network design with exponential scenarios
zbMATH Open document ID: 1266.68031
author: Rohit Khandekar
author: Guy Kortsarz
author: Mohammad Salavatipour
author: Vahab S. Mirrokni
published in: Algorithmica
publication date: 2013-03-05T00:00:00Z
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6141203
zbMATH Keywords: approximation algorithms
zbMATH Keywords: hardness of approximation
zbMATH Keywords: robust network design
zbMATH Keywords: robust Steiner tree
zbMATH Keywords: robust Steiner forest
zbMATH Keywords: robust facility location
MaRDI profile type: Publication
full work available at URL: s00453-011-9596-0
OpenAlex ID: W2076901012
cites work: An improved LP-based approximation for Steiner tree
cites work: Linear programming under uncertainty
cites work: Robust Combinatorial Optimization with Exponential Scenarios
cites work: The Complexity of Multiterminal Cuts
cites work: Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems
cites work: Boosted sampling
cites work: Thresholded Covering Algorithms for Robust and Max-min Optimization
cites work: Q5501328
cites work: Q5832743
cites work: Hedging uncertainty: approximation algorithms for stochastic optimization problems
cites work: Q4952699
DOI: 10.1007/S00453-011-9596-0
description: scientific article; zbMATH DE number 6141203