Summary and Info
This textbook provides a "cheap ticket" to the design of algorithms for hardcomputing problems, Le., for problems for which no low-degree polynomial-timealgorithms1 are known. It focuses on a systematic presentation of the fundamentalconcepts and algorithm design techniques. Thepresentation of these concepts and techniques starts with some fundamentalinformal ideas that are later consecutively specified in detail. The algorithmsused to illustrate the application of these methods are chosen with respect totheir simplicity and transparency rather than with respect to their quality (complexityand reliability).
More About the Author
Juraj Hromkovič (born 1958) is a Slovak Computer Scientist and Professor at ETH Zürich. He is the author of numerous monographs and scientific publications in the field of algorithmics, computational complexity theory, and randomization.
Review and Comments
Rate the Book
Algorithmics for Hard Problems: Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics 0 out of 5 stars based on 0 ratings.