The Design of Approximation Algorithms

约 91 个字 预计阅读时间不到 1 分钟

作者 David P. Williamson 和 David B. Shmoys

谁懂组会开幕 LP 然后想等 LP 以后的结论结果到组会结束还在 LP 的救赎感

Table of Contents

Section 1

• 1. An Introduction to Approximation Algorithms
• 2. Greedy Algorithms and Local Search
• 3. Rounding data and dynamic programming
• 4. Deterministic rounding of Linear Programs
• 5. Random sampling and randomized rounding of Linear Programs
• 6. Randomized rounding of semidefinite programs
• 7. The primal-dual method
• 8. Cuts and metrics

Section 2