Online and Stochastic Survivable Network Design

DOI10.1137/09076725XzbMath1260.05152OpenAlexW2044622025MaRDI QIDQ4910579

Anupam Gupta, R. Ravi, Ravishankar Krishnaswamy

Publication date: 19 March 2013

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/09076725x

zbMATH Keywords

stochastic optimizationonline algorithmsapproximation algorithmssurvivable network design

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Related Items (5)

Tight bounds for online weighted tree augmentation ⋮ The complexity of optimal design of temporally connected graphs ⋮ Unnamed Item ⋮ Tight Bounds for Online Weighted Tree Augmentation ⋮ Unnamed Item

This page was built for publication: Online and Stochastic Survivable Network Design