Design of Approximation Algorithms (Hardcover)
 
作者: David P Williamson 
分類: Optimization ,
Algorithms & data structures ,
Software Engineering  
書城編號: 383257


售價: $826.00

購買後立即進貨, 約需 18-25 天

 
 
出版社: Cambridge University Press
出版日期: 2011/06/30
尺寸: 262x187x34mm
重量: 1089 grams
ISBN: 9780521195270
 
>> 相關電子書

商品簡介
Discrete optimization problems are everywhere, from traditional operations research planning problems, such as scheduling, facility location, and network design; to computer science problems in databases; to advertising issues in viral marketing. Yet most such problems are NP-hard. Thus unless P = NP, there are no efficient algorithms to find optimal solutions to such problems. 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 part of the book is devoted to a single algorithmic technique, which is then applied to several different problems. The second part revisits the techniques but offers more sophisticated treatments of them. The book also covers methods for proving that optimization problems are hard to approximate. Designed as a textbook for graduate-level algorithms courses, the book will also serve as a reference for researchers interested in the heuristic solution of discrete optimization problems.
David P Williamson 作者作品表

Network Flow Algorithms (Paperback)

Design of Approximation Algorithms (Hardcover)

* 以上資料僅供參考之用, 香港書城並不保證以上資料的準確性及完整性。
* 如送貨地址在香港以外, 當書籍/產品入口時, 顧客須自行繳付入口關稅和其他入口銷售稅項。

 

 

 

  我的賬戶 |  購物車 |  出版社 |  團購優惠
加入供應商 |  廣告刊登 |  公司簡介 |  條款及細則

香港書城 版權所有 私隱政策聲明

顯示模式: 電腦版 (改為: 手機版)