Cart
  • Free Shipping on all orders in Australia
  • Over 7 million books in stock
  • Proud to be B-Corp
  • We aim to be carbon neutral by 2022
  • Over 120,000 Trustpilot reviews
Item 1 of 0
Algorithmics for Hard Problems By Juraj Hromkovic

Algorithmics for Hard Problems by Juraj Hromkovic

Condition - New
$158,19
Only 2 left

Summary

Algorithmic design, especially for hard problems, is more essential for success in solving them than any standard improvement of current computer tech nologies.

This book will be specially printed for your order, which means it may take a little longer to arrive (5 days). We do this to cut down on waste & to help protect our planet.

Algorithmics for Hard Problems Summary

Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics by Juraj Hromkovic

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.

Table of Contents

1 Introduction.- 2 Elementary Fundamentals.- 3 Deterministic Approaches.- 4 Approximation Algorithms.- 5 Randomized Algorithms.- 6 Heuristics.- 7 A Guide to Solving Hard Problems.- References.

Additional information

NLS9783642079092
9783642079092
3642079091
Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics by Juraj Hromkovic
New
Paperback
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
2010-12-08
538
N/A
Book picture is for illustrative purposes only, actual binding, cover or edition may vary.
This is a new book - be the first to read this copy. With untouched pages and a perfect binding, your brand new copy is ready to be opened for the first time

Customer Reviews - Algorithmics for Hard Problems