Item description for Algorithmics for Hard Problems by Juraj Hromkovic...
There are several approaches to attack hard problems. All have their merits, but also their limitations, and need a large body of theory as their basis. A number of books for each one exist: books on complexity theory, others on approximation algorithms, heuristic approaches, parametrized complexity, and yet others on randomized algorithms. This book discusses thoroughly all of the above approaches. And, amazingly, at the same time, does this in a style that makes the book accessible not only to theoreticians, but also to the non-specialist, to the student or teacher, and to the programmer. Do you think that mathematical rigor and accessibility contradict? Look at this book to find out that they do not, due to the admirable talent of the author to present his material in a clear and concise way, with the idea behind the approach spelled out explicitly, often with a revealing example. Reading this book is a beautiful experience and I can highly recommend it to anyone interested in learning how to solve hard problems. It is not just a condensed union of material from other books. Because it discusses the different approaches in depth, it has the chance to compare them in detail, and, most importantly, to highlight under what circumstances which approach might be worth exploring. No book on a single type of solution can do that, but this book does it in an absolutely fascinating way that can serve as a pattern for theory textbooks with a high level of generality. (Peter Widmayer) The second edition extends the part on the method of relaxation to linear programming with an emphasis on rounding, LP-duality, and primal-dual schema, and provides a self-contained and transparent presentation of the design of randomized algorithms for primality testing.
Promise Angels is dedicated to bringing you great books at great prices. Whether you read for entertainment, to learn, or for literacy - you will find what you want at promiseangels.com!
Est. Packaging Dimensions: Length: 9.29" Width: 6.22" Height: 1.34" Weight: 2.03 lbs.
Release Date Nov 19, 2002
ISBN 3540441344 ISBN13 9783540441342
Availability 147 units. Availability accurate as of May 28, 2017 01:01.
Usually ships within one to two business days from La Vergne, TN.
Orders shipping to an address other than a confirmed Credit Card / Paypal Billing address may incur and additional processing delay.
Reviews - What do customers think about Algorithmics for Hard Problems?
Good Book for Advanced Computing Feb 12, 2003
Algorithmics for Hard Problems addresses an important (if somewhat small) group of technical people who work exclusively on intractable problems. It takes a great deal of creativity and a large set of intellectual tools to make even modest progress on these problems. Prof. Hromkovic's book presents and organizes a big package of ideas and tools for approaching these problems. Even the last section, entitled "A Guide to Solving Hard Problems" addresses some of the practical issues of working on problems for which a completely satisfactory answer may be out of reach.
This book is especially helpful for software professionals solving difficult problems because it helps one to categorize and understand where the "pain points" can be found. In many software applications very hard problems are hidden within perfectly reasonable appearing and seemingly benign systems -- it's critical in these cases to correctly project the details of the problem onto a well defined set of basis tasks.