A constant-factor approximation for stochastic Steiner forest
From MaRDI portal
Publication:5172762
DOI10.1145/1536414.1536504zbMath1304.68217OpenAlexW2118639405MaRDI QIDQ5172762
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: https://doi.org/10.1145/1536414.1536504
Trees (05C05) Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (3)
Approximation algorithms for stochastic combinatorial optimization problems ⋮ Approximation Algorithms for Single and Multi-Commodity Connected Facility Location ⋮ Improved bounds in stochastic matching and optimization
This page was built for publication: A constant-factor approximation for stochastic Steiner forest