Towards distributed two-stage stochastic optimization
From MaRDI portal
distributed graph algorithmsprimal-dual algorithmtwo-stage stochastic optimizationweighted vertex cover
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15) Stochastic programming (90C15) Programming involving graphs or networks (90C35)
Cites work
- A better approximation ratio for the vertex cover problem
- A deterministic distributed 2-approximation for weighted vertex cover in \(O(\log N\log\varDelta/\log^2\log\varDelta)\) rounds
- A Distributed (2 + ε)-Approximation for Vertex Cover in O(log Δ / ε log log Δ) Rounds
- A fast and simple randomized parallel algorithm for maximal matching
- A linear-time approximation algorithm for the weighted vertex cover problem
- A Local 2-Approximation Algorithm for the Vertex Cover Problem
- A primal-dual 3-approximation algorithm for the stochastic facility location problem with submodular penalties
- A Primal-Dual Parallel Approximation Technique Applied to Weighted Set and Vertex Covers
- A simple local 3-approximation algorithm for vertex cover
- An approximation scheme for stochastic linear programming and its application to stochastic integer programs
- Approximation algorithm for stochastic prize-collecting Steiner tree problem
- Approximation algorithms for distributionally-robust stochastic optimization with black-box distributions
- Approximation algorithms for stochastic and risk-averse optimization
- Approximation algorithms for stochastic combinatorial optimization problems
- Approximation algorithms for stochastic set cover and single sink rent-or-buy with submodular penalty
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Distributed algorithms for covering, packing and maximum weighted matching
- Distributed Computing: A Locality-Sensitive Approach
- Distributed weighted vertex cover via maximal matchings
- Hedging uncertainty: approximation algorithms for stochastic optimization problems
- scientific article; zbMATH DE number 6381764 (Why is no real title available?)
- scientific article; zbMATH DE number 3889282 (Why is no real title available?)
- scientific article; zbMATH DE number 3115465 (Why is no real title available?)
- scientific article; zbMATH DE number 6469210 (Why is no real title available?)
- scientific article; zbMATH DE number 7650882 (Why is no real title available?)
- scientific article; zbMATH DE number 7650071 (Why is no real title available?)
- Improved deterministic distributed matching via rounding
- Introduction to algorithms.
- Introduction to stochastic programming.
- Linear programming under uncertainty
- LP Rounding Approximation Algorithms for Stochastic Network Design
- On the distributed complexity of computing maximal matchings
- Optimal Distributed Covering Algorithms
- Reducibility among combinatorial problems
- Risk-averse stochastic optimization: probabilistically-constrained models and algorithms for black-box distributions (extended abstract)
- Robust Combinatorial Optimization with Exponential Scenarios
- Sampling and cost-sharing: approximation algorithms for stochastic optimization problems
- Sampling-based approximation algorithms for multistage stochastic optimization
- Some simple distributed algorithms for sparse networks
- Stochastic combinatorial optimization with controllable risk aversion level
- Stochastic integer programming: general models and algorithms
- The A priori traveling repairman problem
- The locality of distributed symmetry breaking
- The price of being near-sighted
- The stochastic single resource service-provision problem
- Two‐stage stochastic integer programming: a survey
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
- Vertex packings: Structural properties and algorithms
This page was built for publication: Towards distributed two-stage stochastic optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6871603)
