Probabilistic Methods in Combinatorial and Stochastic Optimization

@inproceedings{AukVkProbabilisticMI,
  title={Probabilistic Methods in Combinatorial and Stochastic Optimization},
  author={AukVk and Auo}
}
  • AukVk, Auo
In this thesis we study a variety of combinatorial problems with inherent randomness. In the first part of the thesis, we study the possibility of covering the solutions of an optimization problem on random subgraphs. The motivation for this approach is a situation where an optimization problem needs to be solved repeatedly for random instances. Then we seek a pre-processing stage which would speed-up subsequent queries by finding a fixed sparse subgraph covering the solution for a random… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 45 references

Approximation algorithms for stochastic scheduling problems

  • B. Dean
  • PhD thesis, Massachusetts Institute of Technology…
  • 2005
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…