Approximation Techniques for Stochastic Combinatorial Optimization Problems
The focus of this thesis is on the design and analysis of algorithms for basic problems in Stochastic Optimization, specifically a class of fundamental combinatorial optimization problems where there is some form of uncertainty in the input. Since many interesting optimization problems are computati...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
Research Showcase @ CMU
2012
|
| Subjects: | |
| Online Access: | http://repository.cmu.edu/dissertations/157 http://repository.cmu.edu/cgi/viewcontent.cgi?article=1162&context=dissertations |