The Design of Approximation Algorithms

The Design of Approximation Algorithms pdf epub mobi txt 电子书 下载 2025

David P. Williamson
承接 住宅 自建房 室内改造 装修设计 免费咨询 QQ:624617358 一级注册建筑师 亲自为您回答、经验丰富,价格亲民。无论项目大小,都全力服务。期待合作,欢迎咨询!QQ:624617358
想要找书就要到 图书大百科
立刻按 ctrl+D收藏本页
你会得到大惊喜!!
Cambridge University Press 2011-4-26 Hardcover 9780521195270

具体描述

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.

用户评价

评分

评分

##案头手册书,基本上所有常用的的近似算法技术都有涉及,而且包含了很多经典结果的简化。闲着没事的时候读读总有新收获。

评分

评分

评分

##题材组织的还不错,不过例题的讲解没有vazirani那本清楚

评分

评分

评分

##题材组织的还不错,不过例题的讲解没有vazirani那本清楚

评分

个人觉得比Vijay的写得好。

本站所有内容均为互联网搜索引擎提供的公开搜索信息,本站不存储任何数据与内容,任何内容与数据均与本站无关,如有需要请联系相关搜索引擎包括但不限于百度google,bing,sogou

© 2025 book.qciss.net All Rights Reserved. 图书大百科 版权所有