A randomized linear-time algorithm to find minimum spanning trees
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Allocating Bandwidth for Bursty Connections
SIAM Journal on Computing
A Constant-Factor Approximation Algorithm for the Multicommodity
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Primal-Dual Algorithms for Connected Facility Location Problems
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Simpler and better approximation algorithms for network design
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A tight bound on approximating arbitrary metrics by tree metrics
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Boosted sampling: approximation algorithms for stochastic optimization
STOC '04 Proceedings of the thirty-sixth 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
Sampling-based Approximation Algorithms for Multi-stage Stochastic
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
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
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 via cost sharing: Simpler and better approximation algorithms for network design
Journal of the ACM (JACM)
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
Mechanism design for stochastic optimization problems
ACM SIGecom Exchanges
Stochastic analyses for online combinatorial optimization problems
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A plant location guide for the unsure
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Permutation betting markets: singleton betting with extra information
Proceedings of the 9th ACM conference on Electronic commerce
Approximation Algorithms for 2-Stage Stochastic Scheduling Problems
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Infrastructure Leasing Problems
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Robust Combinatorial Optimization with Exponential Scenarios
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Two-Stage Robust Network Design with Exponential Scenarios
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Deterministic Sampling Algorithms for Network Design
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Commitment under uncertainty: Two-stage stochastic matching problems
Theoretical Computer Science
Stochastic Steiner Tree with Non-uniform Inflation
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
Risk aversion min-period retiming under process variations
Proceedings of the 2009 Asia and South Pacific Design Automation Conference
A constant-factor approximation for stochastic Steiner forest
Proceedings of the forty-first annual ACM symposium on Theory of computing
Online and stochastic survivable network design
Proceedings of the forty-first annual ACM symposium on Theory of computing
Exceeding expectations and clustering uncertain data
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Stochastic Combinatorial Optimization with Controllable Risk Aversion Level
Mathematics of Operations Research
A Plant Location Guide for the Unsure: Approximation Algorithms for Min-Max Location Problems
Mathematics of Operations Research
Pricing tree access networks with connected backbones
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Steiner forests on stochastic metric graphs
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
On the Power of Robust Solutions in Two-Stage Stochastic and Adaptive Optimization Problems
Mathematics of Operations Research
Hybrid energy storage system integration for vehicles
Proceedings of the 16th ACM/IEEE international symposium on Low power electronics and design
How to probe for an extreme value
ACM Transactions on Algorithms (TALG)
Thresholded covering algorithms for robust and max-min optimization
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
Stochastic minimum spanning trees in euclidean spaces
Proceedings of the twenty-seventh annual symposium on Computational geometry
Adaptive Uncertainty Resolution in Bayesian Combinatorial Optimization Problems
ACM Transactions on Algorithms (TALG)
Strict Cost Sharing Schemes for Steiner Forest
SIAM Journal on Computing
A General Approach for Incremental Approximation and Hierarchical Clustering
SIAM Journal on Computing
Sampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems
SIAM Journal on Computing
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
An incremental model for combinatorial maximization problems
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Stochastic steiner trees without a root
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
On two-stage stochastic minimum spanning trees
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
What about wednesday? approximation algorithms for multistage stochastic optimization
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Sampling bounds for stochastic optimization
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Improved approximation results for stochastic knapsack problems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
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
Stochastic combinatorial optimization with controllable risk aversion level
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
Stochastic covering and adaptivity
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Stochastic vehicle routing with recourse
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Algorithms for stochastic optimization of multicast content delivery with network coding
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
Commitment under uncertainty: two-stage stochastic matching problems
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Catch them if you can: how to serve impatient users
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Approximability of the two-stage stochastic knapsack problem with discretely distributed weights
Discrete Applied Mathematics
| Hi-index | 0.00 |
Combinatorial optimization is often used to "plan ahead," purchasing and allocating resources for demands that are not precisely known at the time of solution. This advance planning may be done because resources become very expensive to purchase or difficult to allocate at the last minute when the demands are known. In this work we study the tradeoffs involved in making some purchase/allocation decisions early to reduce cost while deferring others at greater expense to take advantage of additional, late-arriving information. We consider a number of combinatorial optimization problems in which the problem instance is uncertain---modeled by a probability distribution---and in which solution elements can be purchased cheaply now or at greater expense after the distribution is sampled. We show how to approximately optimize the choice of what to purchase in advance and what to defer.