NP难题近似算法（稀缺藏书）
5星
- 浏览量: 0
- 大小:None
- 文件类型：None
简介：
《NP难题近似算法》是一本稀缺藏书，深入探讨了复杂问题的有效解决策略。本书汇集了近似算法的经典理论与最新研究成果，为研究者和学生提供了宝贵资源。
这本书在国内已经绝版了。以下是目录：
Introduction
Dorit S. Hochbaum
0.1 What can approximation algorithms do for you: an illustrative example
0.2 Fundamentals and concepts
0.3 Objectives and organization of this book
0.4 Acknowledgments
I Approximation Algorithms for Scheduling
Leslie A. Hall
1.1 Introduction
1.2 Sequencing with Release Dates to Minimize Lateness
...（省略部分目录项）...
II Approximating Covering and Packing Problems: Set Cover, Vertex Cover, Independent Set, and Related Problems
Dorit S. Hachbaum
3.1 Introduction
...
III The Primal-Dual Method for Approximation Algorithms and Its Application to Network Design Problems
Michel X. Goemans and David P. Williamson
4.1 Introduction
...（省略部分目录项）...
IV Cut Problems and Their Applications to Divide-and-Conquer
David B. Shmoys
5.1 Introduction
...
V Approximation Algorithms for Finding Highly Connected Subgraphs
Samir Khuller
6.1 Introduction
...
VI Algorithms for Finding Low Degree Structures
Balaji Raghavachari
7.1 Introduction
...（省略部分目录项）...
XII The Markov Chain Monte Carlo Method: An Approach to Approximate Counting and Integration
Mark Jerrum and Alistair Sinclair
12.1 Introduction
...
Appendix
XIII Online Computation
Sandy Irani and Anna R. Karlin
13.1 Introduction
...（省略部分目录项）...
Glossary of Problems
Index
全部评论 (0)
