Algorithmics For Hard Problems: Introduction To Combinatorial Optimization, Randomization, Approximation, And Heuristics: Introduct by Juraj HromkoviAlgorithmics For Hard Problems: Introduction To Combinatorial Optimization, Randomization, Approximation, And Heuristics: Introduct by Juraj Hromkovi

Algorithmics For Hard Problems: Introduction To Combinatorial Optimization, Randomization…

byJuraj Hromkovi

Hardcover | November 19, 2002

Pricing and Purchase Info

$117.50

Earn 588 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

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.
Title:Algorithmics For Hard Problems: Introduction To Combinatorial Optimization, Randomization…Format:HardcoverDimensions:538 pagesPublished:November 19, 2002Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3540441344

ISBN - 13:9783540441342

Look for similar items by category:

Reviews

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.