| 期刊全稱(chēng) | Approximation Algorithms | | 影響因子2023 | Vijay V. Vazirani | | 視頻video | http://file.papertrans.cn/161/160381/160381.mp4 | | 發(fā)行地址 | Spreads powerful algorithmic ideas developed in this area to practitioners.Will accelerate progress in this area.Raises algorithmic awareness of the scientific community by showing simple ways of expr | | 圖書(shū)封面 |  | | 影響因子 | Although this may seem a paradox, all exact science is dominated by the idea of approximation. Bertrand Russell (1872-1970) Most natural optimization problems, including those arising in important application areas, are NP-hard. Therefore, under the widely believed con- jecture that P -=/= NP, their exact solution is prohibitively time consuming. Charting the landscape of approximability of these problems, via polynomial time algorithms, therefore becomes a compelling subject of scientific inquiry in computer science and mathematics. This book presents the theory of ap- proximation algorithms as it stands today. It is reasonable to expect the picture to change with time. This book is divided into three parts. In Part I we cover combinato- rial algorithms for a number of important problems, using a wide variety of algorithm design techniques. The latter may give Part I a non-cohesive appearance. However, this is to be expected - nature is very rich, and we cannot expect a few tricks to help solve the diverse collection of NP-hard problems. Indeed, in this part, we have purposely refrained from tightly cat- egorizing algorithmic techniques so as not to trivialize matters. Instead, we | | Pindex | Book 2003 |
The information of publication is updating
|
|
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-6 09:18
發(fā)表于 2025-3-21 18:31:42
