图书目录大全

The Design of Approximation Algorithms 在线电子书 pdf 下载 txt下载 epub 下载 mobi 下载 2024

☆☆☆☆☆
简体网页||繁体网页

David P. Williamson 作者

Cambridge University Press

译者

2011-4-26 出版日期

518 页数

GBP 51.99 价格

Hardcover

丛书系列

9780521195270 图书编码

The Design of Approximation Algorithms 在线电子书图书标签: 算法近似算法计算机科学数学计算机理论计算机编程计算机技术

喜欢 The Design of Approximation Algorithms 在线电子书的读者还喜欢

下载链接在页面底部

点击这里下载

想要找书就要到图书目录大全

book.wenda123.org

立刻按 ctrl+D收藏本页

你会得到大惊喜!!

发表于2024-11-15

facebook linkedin mastodon messenger pinterest reddit telegram twitter viber vkontakte whatsapp 复制链接

The Design of Approximation Algorithms 在线电子书 epub 下载 mobi 下载 pdf 下载 txt 下载 2024

The Design of Approximation Algorithms 在线电子书 pdf 下载 txt下载 epub 下载 mobi 下载 2024

The Design of Approximation Algorithms 在线电子书用户评价

评分☆☆☆☆☆

个人觉得是近似算法最好的教材。

评分☆☆☆☆☆

个人觉得是近似算法最好的教材。

评分☆☆☆☆☆

个人觉得是近似算法最好的教材。

评分☆☆☆☆☆

还是比较全的可以再加一些property testing的模型比如 monotonicity, regularity lemma, triangle freeness 之类的

评分☆☆☆☆☆

还是比较全的可以再加一些property testing的模型比如 monotonicity, regularity lemma, triangle freeness 之类的

The Design of Approximation Algorithms 在线电子书著者简介

The Design of Approximation Algorithms 在线电子书图书目录

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

The Design of Approximation Algorithms 在线电子书图书描述

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 在线电子书下载 mobi epub pdf txt 在线电子书下载

想要找书就要到图书目录大全

book.wenda123.org

立刻按 ctrl+D收藏本页

你会得到大惊喜!!