Get Free Shipping on orders over $49
Algorithmics for Hard Problems : Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics - Juraj Hromkovič

Algorithmics for Hard Problems

Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics

By: Juraj Hromkovič

Hardcover | 14 April 2004 | Edition Number 2

At a Glance

Hardcover


$149.75

or 4 interest-free payments of $37.44 with

 or 

Ships in 5 to 7 business days

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.

Other Editions and Formats

Paperback

Published: 9th December 2010

More in Computer Programming & Software Development

Web Engineering : Theory and Practice - Jeremiah Downey
The Essence of Software Engineering - Cersei Page
Introduction to Programming Languages - Gordon Hurley
The Practical Guide : The Practical Guide - Kerem Koseoglu
Computer Coding Python Games for Kids : DK Help Your Kids With - Carol Vorderman
Building Websites All-in-One For Dummies - Paul McFedries
MacBook Neo For Dummies - Mark L. Chambers

RRP $41.95

$33.75

20%
OFF
Computer Systems 3ed : A Programmer's Perspective, Global Edition - Randal Bryant
Python All-in-One For Dummies : 3rd Edition - John C. Shovic

RRP $74.95

$55.75

26%
OFF
Addiction by Design : Machine Gambling in Las Vegas - Natasha Dow Schull
The Lego Technic Idea Book : Simple Machines - Yoshihito Isogawa

RRP $55.00

$42.75

22%
OFF
Linux Pocket Guide : 4th Edition - Essential Commands - Daniel J. Barrett