Probabilistic methods in combinatorial and stochastic optimization
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2005. === Includes bibliographical references (leaves 103-106). === (cont.) Packing/Covering problems, we prove upper and lower bounds on the adaptivity gap depending on the dimension. We also design polynomial-time algori...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
Massachusetts Institute of Technology
2005
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/28827 |