Online and stochastic survivable network design
From MaRDI portal
Publication:5172766
DOI10.1145/1536414.1536507zbMath1304.68139OpenAlexW2110681594MaRDI QIDQ5172766
R. Ravi, Anupam Gupta, Ravishankar Krishnaswamy
Publication date: 4 February 2015
Published in: Proceedings of the forty-first annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.217.6287
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)
Related Items (4)
An O(logn)-Competitive Algorithm for Online Constrained Forest Problems ⋮ Stochastic survivable network design problems: theory and practice ⋮ Online constrained forest and prize-collecting network design ⋮ Network construction with subgraph connectivity constraints
This page was built for publication: Online and stochastic survivable network design
