首页--数理科学和化学论文--运筹学论文--最优化的数学理论论文

Approximation Algorithms for Some Stochastic Problems of Combinatorial Optimization

Abstract (in English)第3页
Abstract (in Chinese)第4-6页
Chapter 1 Introduction第6-18页
    1.1 The background of cover problem and steiner tree problem第6-13页
    1.2 Basic knowledge第13-14页
    1.3 Related work of cover problem and steiner tree problem第14-16页
    1.4 Our results of cover problem and steiner tree problem第16-17页
    1.5 Organization of the thesis第17-18页
Chapter 2 Primal-Dual Algorithm第18-23页
    2.1 Induction and history第18-19页
    2.2 The classic primal-dual method第19-23页
Chapter 3 Stochastic Set Cover Problem with Submodular Penalties第23-37页
    3.1 Introduction of the problem第23-26页
    3.2 The primal-dual algorithm第26-29页
    3.3 The analysis of the algorithm第29-37页
Chapter 4 Stochastic Prize-Collecting Steiner Tree Problem第37-47页
    4.1 Introduction of the problem第37-40页
    4.2 The primal-dual algorithm第40-42页
    4.3 The analysis of the algorithm第42-47页
Chapter 5 Conclusion第47-48页
Bibliography第48-53页
Acknowledgements第53页

论文共53页,点击 下载论文
上一篇:神经网络expectile回归模型及应用
下一篇:Global Well-posedness for the Two-component Camassa-Holm Equation with Fractional Dissipation