Algorithmics for Hard Problems:Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics(Texts in Theoretical Computer Science. An EATCS Series)

通信技术

原   价:
1165
售   价:
932.00
优惠
平台大促 低至8折优惠
发货周期:外国库房发货,通常付款后3-5周到货
作      者
出  版 社
出版时间
2002年10月09日
装      帧
ISBN
9783540441342
复制
页      码
538
开      本
语      种
英文
版      次
2nd Ed.
综合评分
暂无评分
我 要 买
- +
库存 100 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
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 which should be in­ cluded in the education of every computer science student. Unfortunately, this is very far from reality. This is because these paradigms are not sufficiently known in the computer science community, and so they are insufficiently com­ municated to students and practitioners.
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个