| 期刊全称 | Algorithmics for Hard Problems | | 期刊简称 | Introduction to Comb | | 影响因子2023 | Juraj Hromkovič | | 视频video | | | 发行地址 | A textbook as well as a handbook on the kernel of current algorithmics.With many examples to support the understanding.Includes supplementary material: | | 学科分类 | 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
|
|
发表于 2025-3-21 16:55:19
