| 書目名稱 | Complexity and Approximation | | 副標(biāo)題 | Combinatorial Optimi | | 編輯 | Giorgio Ausiello,Alberto Marchetti-Spaccamela,Vigg | | 視頻video | http://file.papertrans.cn/232/231659/231659.mp4 | | 概述 | Comprehensive Assessment of numerous problems in combinatorial optimization.Includes supplementary material: | | 圖書封面 |  | | 描述 | N COMPUTER applications we are used to live with approximation. Var- I ious notions of approximation appear, in fact, in many circumstances. One notable example is the type of approximation that arises in numer- ical analysis or in computational geometry from the fact that we cannot perform computations with arbitrary precision and we have to truncate the representation of real numbers. In other cases, we use to approximate com- plex mathematical objects by simpler ones: for example, we sometimes represent non-linear functions by means of piecewise linear ones. The need to solve difficult optimization problems is another reason that forces us to deal with approximation. In particular, when a problem is computationally hard (i. e. , the only way we know to solve it is by making use of an algorithm that runs in exponential time), it may be practically unfeasible to try to compute the exact solution, because it might require months or years of machine time, even with the help of powerful parallel computers. In such cases, we may decide to restrict ourselves to compute a solution that, though not being an optimal one, nevertheless is close to the optimum and may be determined in polyno | | 出版日期 | Textbook 1999 | | 關(guān)鍵詞 | Approximation; Combinatorial Algorithms; Complexity; Computer; Partition; Scheduling; Variable; calculus; co | | 版次 | 1 | | doi | https://doi.org/10.1007/978-3-642-58412-1 | | isbn_softcover | 978-3-642-63581-6 | | isbn_ebook | 978-3-642-58412-1 | | copyright | Springer-Verlag Berlin Heidelberg 1999 |
The information of publication is updating
|
|
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-20 13:24
發(fā)表于 2025-3-21 17:03:26
