The Design of Approximation Algorithms 在線電子書 圖書標籤: 算法 近似算法 計算機科學 數學 計算機理論 計算機 編程 計算機技術
發表於2024-11-25
The Design of Approximation Algorithms 在線電子書 pdf 下載 txt下載 epub 下載 mobi 下載 2024
個人覺得比Vijay的寫得好。
評分題材組織的還不錯,不過例題的講解沒有vazirani那本清楚
評分還是比較全的 可以再加一些property testing的模型 比如 monotonicity, regularity lemma, triangle freeness 之類的
評分個人覺得是近似算法最好的教材。
評分還是比較全的 可以再加一些property testing的模型 比如 monotonicity, regularity lemma, triangle freeness 之類的
Discrete optimization problems are everywhere, from traditional operations research planning (scheduling, facility location and network design); to computer science databases; to advertising issues in viral marketing. Yet most such problems are NP-hard; unless P = NP, there are no efficient algorithms to find optimal solutions. This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. The book is organized around central algorithmic techniques for designing approximation algorithms, including greedy and local search algorithms, dynamic programming, linear and semidefinite programming, and randomization. Each chapter in the first section is devoted to a single algorithmic technique applied to several different problems, with more sophisticated treatment in the second section. The book also covers methods for proving that optimization problems are hard to approximate. Designed as a textbook for graduate-level algorithm courses, it will also serve as a reference for researchers interested in the heuristic solution of discrete optimization problems.
評分
評分
評分
評分
The Design of Approximation Algorithms 在線電子書 pdf 下載 txt下載 epub 下載 mobi 下載 2024