Stochastic combinatorial optimization via poisson approximation
From MaRDI portal
Publication:5495869
DOI10.1145/2488608.2488731zbMath1293.90060arXiv1211.1149OpenAlexW2052371896MaRDI QIDQ5495869
No author found.
Publication date: 7 August 2014
Published in: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1211.1149
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items (12)
Auction Design with a Revenue Target ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Logarithmic Regret in the Dynamic and Stochastic Knapsack Problem with Equal Rewards ⋮ Stochastic Unsplittable Flows ⋮ Lower bounds on the adaptivity gaps in variants of the stochastic knapsack problem ⋮ Unnamed Item ⋮ A fully polynomial-time approximation scheme for approximating a sum of random variables ⋮ Improvements and Generalizations of Stochastic Knapsack and Markovian Bandits Approximation Algorithms ⋮ Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems ⋮ Stochastic Load Balancing on Unrelated Machines ⋮ Adaptive Bin Packing with Overflow
This page was built for publication: Stochastic combinatorial optimization via poisson approximation
