| 期刊全稱 | Algorithmics for Hard Problems | | 期刊簡稱 | Introduction to Comb | | 影響因子2023 | Juraj Hromkovi? | | 視頻video | http://file.papertrans.cn/154/153019/153019.mp4 | | 發(fā)行地址 | A textbook as well as a handbook on the kernel of current algorithmics.With many examples to support the understanding.Includes supplementary material: | | 學(xué)科分類 | Texts in Theoretical Computer Science. An EATCS Series | | 圖書封面 |  | | 影響因子 | Algorithmic design, especially for hard problems, is more essential for success in solving them than any standard improvement of current computer tech- nologies. Because of this, the design of algorithms for solving hard problems is the core of current algorithmic research from the theoretical point of view as well as from the practical point of view. There are many general text books on algorithmics, and several specialized books devoted to particular approaches such as local search, randomization, approximation algorithms, or heuristics. But there is no textbook that focuses on the design of algorithms for hard computing tasks, and that systematically explains, combines, and compares the main possibilities for attacking hard algorithmic problems. As this topic is fundamental for computer science, this book tries to close this gap. Another motivation, and probably the main reason for writing this book, is connected to education. The considered area has developed very dynami- cally in recent years and the research on this topic discovered several profound results, new concepts, and new methods. Some of the achieved contributions are so fundamental that one can speak about paradigms | | Pindex | Textbook 2004Latest edition |
The information of publication is updating
|
|
|Archiver|手機版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-23 22:32
發(fā)表于 2025-3-21 16:55:19
