Boosted sampling
From MaRDI portal
Publication:3580986
DOI10.1145/1007352.1007419zbMath1192.90171OpenAlexW1981673685MaRDI QIDQ3580986
Anupam Gupta, Sinha Amitabh, R. Ravi, Martin Pál
Publication date: 15 August 2010
Published in: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1007352.1007419
Related Items (21)
Approximation algorithms for stochastic combinatorial optimization problems ⋮ Towards an algorithmic synthesis of thermofluid systems ⋮ On stochastic \(k\)-facility location ⋮ Approximation algorithms for facility location problems with a special class of subadditive cost functions ⋮ Universal Algorithms for Clustering Problems ⋮ Two-stage robust network design with exponential scenarios ⋮ Unnamed Item ⋮ Connected facility location via random facility sampling and core detouring ⋮ The \(k\)-level facility location game ⋮ Decomposition methods for the two-stage stochastic Steiner tree problem ⋮ Commitment under uncertainty: Two-stage stochastic matching problems ⋮ When LP is the cure for your matching woes: improved bounds for stochastic matchings ⋮ Deterministic sampling algorithms for network design ⋮ Permutation betting markets: singleton betting with extra information ⋮ Hedging uncertainty: approximation algorithms for stochastic optimization problems ⋮ Two-stage stochastic matching and spanning tree problems: polynomial instances and approximation ⋮ Probabilistic models for the Steiner Tree problem ⋮ Improved approximations for two-stage MIN-cut and shortest path problems under uncertainty ⋮ Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems ⋮ Sampling-Based Approximation Schemes for Capacitated Stochastic Inventory Control Models ⋮ On the power of static assignment policies for robust facility location problems
This page was built for publication: Boosted sampling
