Oblivious routing in directed graphs with random demands
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Universal approximations for TSP, Steiner tree, and set cover
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Adaptivity and approximation for stochastic packing problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Improved lower and upper bounds for universal TSP in planar metrics
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A general approach for incremental approximation and hierarchical clustering
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Provably near-optimal sampling-based algorithms for Stochastic inventory control models
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
An adaptive algorithm for selecting profitable keywords for search-based advertising services
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Asking the right questions: model-driven optimization using probes
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Approximation algorithms for budgeted learning problems
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Integrated Downlink Resource Management for Multiservice WiMAX Networks
IEEE Transactions on Mobile Computing
Optimization of continuous queries with shared expensive filters
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Stochastic shortest paths via Quasi-convex maximization
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Model-driven optimization using adaptive probes
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for stochastic and risk-averse optimization
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Fully polynomial time approximation schemes for stochastic dynamic programs
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Online auctions and generalized secretary problems
ACM SIGecom Exchanges
A Knapsack Secretary Problem with Applications
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
The ratio index for budgeted learning, with applications
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Stochastic Submodular Maximization
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
System-level thermal aware design of applications with uncertain execution time
Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design
Exceeding expectations and clustering uncertain data
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Approximating Matches Made in Heaven
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Stochastic models for budget optimization in search-based advertising
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Randomized priority algorithms
Theoretical Computer Science
The stochastic machine replenishment problem
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
How to probe for an extreme value
ACM Transactions on Algorithms (TALG)
Approximation algorithms for optimal decision trees and adaptive TSP problems
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Approximation algorithms for reliable stochastic combinatorial optimization
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Knapsack problem with probability constraints
Journal of Global Optimization
TECHNICAL NOTE---The Adaptive Knapsack Problem with Stochastic Rewards
Operations Research
Engineering Applications of Artificial Intelligence
Theory and Applications of Robust Optimization
SIAM Review
Approximation algorithms for 2-stage stochastic optimization problems
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Approximation algorithms for stochastic inventory control models
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Single-source stochastic routing
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Online stochastic reservation systems
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Stochastic covering and adaptivity
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
A PTAS for the chance-constrained knapsack problem with random item sizes
Operations Research Letters
Robust local search for solving RCPSP/max with durational uncertainty
Journal of Artificial Intelligence Research
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Approximability of the two-stage stochastic knapsack problem with discretely distributed weights
Discrete Applied Mathematics
| Hi-index | 0.00 |
We consider a stochastic variant of the NP-hard 0/1 knapsack problem in which item values are deterministic and item sizes are independent random variables with known, arbitrary distributions. Items are placed in the knapsack sequentially, and the act of placing an item in the knapsack instantiates its size. Our goal is to compute a solution "policy" that maximizes the expected value of items placed in the knapsack, and we consider both non-adaptive policies (that designate a priori a fixed sequence of items to insert) and adaptive policies (that can make dynamic choices based on the instantiated sizes of items placed in the knapsack thus far). We show that adaptivity provides only a constant-factor improvement by demonstrating a greedy non-adaptive algorithm that approximates the optimal adaptive policy within a factor of 7. We also design an adaptive polynomial-time algorithm which approximates the optimal adaptive policy within a factor of 5 + 驴, for any constant 驴 0.