Approximation algorithms for stochastic combinatorial optimization problems
From MaRDI portal
Recommendations
- Integer Programming and Combinatorial Optimization
- Hedging uncertainty: approximation algorithms for stochastic optimization problems
- Sampling-based approximation algorithms for multistage stochastic optimization
- Approximation Algorithms for 2-Stage Stochastic Optimization Problems
- Sampling and cost-sharing: approximation algorithms for stochastic optimization problems
Cites work
- -kernel coresets for stochastic points
- A constant-factor approximation for stochastic Steiner forest
- A dynamic near-optimal algorithm for online linear programming
- A fully polynomial-time approximation scheme for approximating a sum of random variables
- A multiple-choice secretary algorithm with applications to online auctions
- A plant location guide for the unsure: approximation algorithms for min-Max location problems
- A polynomial-time approximation scheme for fault-tolerant distributed storage
- A PTAS for the chance-constrained knapsack problem with random item sizes
- A Renewal Decision Problem
- A simple \(O(\log\log(\mathrm{rank}))\)-competitive algorithm for the matroid secretary problem
- A Single-Sample Multiple Decision Procedure for Ranking Means of Normal Populations with known Variances
- A stochastic probing problem with applications
- A Utility Equivalence Theorem for Concave Functions
- Adaptivity and approximation for stochastic packing problems
- AdWords and generalized online matching
- Allocating Bandwidth for Bursty Connections
- An approximation scheme for stochastic linear programming and its application to stochastic integer programs
- An approximation theorem for the Poisson binomial distribution
- An improved LP-based approximation for Steiner tree
- Approximating extent measures of points.
- Approximating Matches Made in Heaven
- Approximating the stochastic Knapsack problem: the benefit of adaptivity
- Approximation Algorithms for 2-Stage Stochastic Optimization Problems
- Approximation algorithms for budgeted learning problems
- Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits
- Approximation algorithms for reliable stochastic combinatorial optimization
- Approximation algorithms for restless bandit problems
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Arc Reduction and Path Preference in Stochastic Acyclic Networks
- Bayesian Combinatorial Auctions: Expanding Single Buyer Mechanisms to Many Buyers
- Boosted sampling
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Complexity of some parametric integer and network programming problems
- Conservation Laws, Extended Polymatroids and Multiarmed Bandit Problems; A Polyhedral Approach to Indexable Systems
- Dependent rounding and its applications to approximation algorithms
- Fast algorithms for online stochastic convex programming
- Four proofs of Gittins' multiarmed bandit theorem
- Greedy algorithms for Steiner forest
- 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 2089367 (Why is no real title available?)
- scientific article; zbMATH DE number 5764830 (Why is no real title available?)
- scientific article; zbMATH DE number 3784589 (Why is no real title available?)
- scientific article; zbMATH DE number 3638998 (Why is no real title available?)
- scientific article; zbMATH DE number 6469210 (Why is no real title available?)
- scientific article; zbMATH DE number 3383344 (Why is no real title available?)
- scientific article; zbMATH DE number 7053373 (Why is no real title available?)
- Improved analysis of the greedy algorithm for stochastic matching
- Improved approximation algorithms for stochastic matching
- Improved approximation results for stochastic knapsack problems
- Improved Bounds for Online Stochastic Matching
- Improved bounds in stochastic matching and optimization
- Improved competitive ratio for the matroid secretary problem
- Improved lower and upper bounds for universal TSP in planar metrics
- Improvements and generalizations of stochastic knapsack and multi-armed bandit approximation algorithms: extended abstract
- Introduction to stochastic programming.
- Kidney Exchange
- Lectures on stochastic programming. Modeling and theory.
- Linear programming under uncertainty
- Matroid prophet inequalities
- Matroid secretary problem in the random-assignment model
- Matroids, secretary problems, and online mechanisms
- Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems
- Multi-armed Bandits with Metric Switching Costs
- Multi-parameter mechanism design and sequential posted pricing
- On Optimal Replacement Policies
- On the adaptivity gap of stochastic orienteering
- On the complexity of best-arm identification in multi-armed bandit models
- Online bipartite matching with random arrivals, an approach based on strongly factor-revealing LPs
- Online bipartite matching with unknown distributions
- Online contention resolution schemes
- Online stochastic matching with unequal probabilities
- Online Stochastic Matching: Beating 1-1/e
- Online stochastic matching: new algorithms with better bounds
- Online stochastic packing applied to display ad allocation
- Optimal paths in graphs with stochastic or multidimensional weights
- Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems
- Prediction, Learning, and Games
- Primal beats dual on online packing LPs in the random-order model
- Real Analysis and Probability
- Regret analysis of stochastic and nonstochastic multi-armed bandit problems
- Renewal Decision Problem-Random Horizon
- Renewal Decisions when Category Life Distributions are of Phase-Type
- 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
- Secretary problems: laminar matroid and interval scheduling
- Simplex partitioning via exponential clocks and the multiway cut problem
- Smallest enclosing ball for probabilistic data
- Stochastic Shortest Paths Via Quasi-convex Maximization
- Stochastic Steiner Tree with Non-uniform Inflation
- Strict cost sharing schemes for Steiner forest
- Submodular function maximization via the multilinear relaxation and contention resolution schemes
- The Complexity of Markov Decision Processes
- The design of approximation algorithms
- The sample complexity of exploration in the multi-armed bandit problem
- Theory of games and economic behavior.
- Thresholded covering algorithms for robust and max-min optimization
- Two-stage robust network design with exponential scenarios
- Universal approximations for TSP, Steiner tree, and set cover
- When LP is the cure for your matching woes: improved bounds for stochastic matchings
Cited in
(22)- Approximation algorithm for stochastic set cover problem
- Approximation algorithms for stochastic set cover and single sink rent-or-buy with submodular penalty
- Min max min robust (relative) regret combinatorial optimization
- The million-variable ``march for stochastic combinatorial optimization
- Approximation algorithm for the stochastic prize-collecting set multicover problem
- On the complexity of nonoverlapping multivariate marginal bounds for probabilistic combinatorial optimization problems
- scientific article; zbMATH DE number 6381764 (Why is no real title available?)
- scientific article; zbMATH DE number 3873085 (Why is no real title available?)
- Approximating the Expected Values for Combinatorial Optimization Problems over Stochastic Points
- Generalized Dynamic Programming for Stochastic Combinatorial Optimization
- On Approximate Solutions for Combinatorial Optimization Problems
- Methodology for Stochastic Graph Completion-Time Problems
- scientific article; zbMATH DE number 1961527 (Why is no real title available?)
- scientific article; zbMATH DE number 1789921 (Why is no real title available?)
- Probabilistic Combinatorial Optimization: Moments, Semidefinite Programming, and Asymptotic Bounds
- Approximation Algorithms for 2-Stage Stochastic Optimization Problems
- scientific article; zbMATH DE number 6469210 (Why is no real title available?)
- Integer Programming and Combinatorial Optimization
- scientific article; zbMATH DE number 7650393 (Why is no real title available?)
- A truthful near-optimal mechanism for online linear packing-covering problem in the random order model
- Towards distributed two-stage stochastic optimization
- Approximation algorithms for k-submodular maximization subject to a knapsack constraint
This page was built for publication: Approximation algorithms for stochastic combinatorial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q290321)
