Algorithmics for Hard Problems

Algorithmics for Hard Problems

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.


Author
Publisher Springer Science & Business Media
Release Date
ISBN 3662052695
Pages 538 pages
Rating 4/5 (93 users)

More Books:

Algorithmics for Hard Problems
Language: en
Pages: 538
Authors: Juraj Hromkovič
Categories: Computers
Type: BOOK - Published: 2013-03-14 - Publisher: Springer Science & Business Media

Algorithmic design, especially for hard problems, is more essential for success in solving them than any standard improvement of current computer tech nologies.
Algorithmics for Hard Problems
Language: en
Pages: 494
Authors: Juraj Hromkovič
Categories: Computers
Type: BOOK - Published: 2013-03-14 - Publisher: Springer Science & Business Media

An introduction to the methods of designing algorithms for hard computing tasks, concentrating mainly on approximate, randomized, and heuristic algorithms, and
Algorithmics for Hard Problems
Language: en
Pages: 492
Authors: Juraj Hromkovič
Categories: Computers
Type: BOOK - Published: 2001-05-22 - Publisher: Springer

An introduction to the methods of designing algorithms for hard computing tasks, concentrating mainly on approximate, randomized, and heuristic algorithms, and
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications
Language: en
Pages: 225
Authors: Bevern, René van
Categories: Mathematics
Type: BOOK - Published: 2014-10-01 - Publisher: Universitätsverlag der TU Berlin

This thesis aims for the development of efficient algorithms to exactly solve four selected NP-hard graph and hypergraph problems arising in the fields of sched
Algorithms and Complexity
Language: en
Pages: 290
Authors: Rosella Petreschi
Categories: Mathematics
Type: BOOK - Published: 2003-08-03 - Publisher: Springer

This book constitutes the refereed proceedings of the 5th Italian Conference on Algorithms and Computation, CIAC 2003, held in Rome, Italy in May 2003.The 23 re
DESIGN METHODS AND ANALYSIS OF ALGORITHMS
Language: en
Pages: 328
Authors: S. K. BASU
Categories: Computers
Type: BOOK - Published: 2005-01-01 - Publisher: PHI Learning Pvt. Ltd.

The design of correct and efficient algorithms for problem solving lies at the heart of computer science. This concise text, without being highly specialized, t
Approximation Algorithms for NP-hard Problems
Language: en
Pages: 596
Authors: Edited By Dorit S Hochbaum
Categories: Mathematics
Type: BOOK - Published: 1997 - Publisher: Course Technology Ptr

This is the first book to fully address the study of approximation algorithms as a tool for coping with intractable problems. With chapters contributed by leadi
Algorithmics
Language: en
Pages: 513
Authors: David Harel
Categories: Computers
Type: BOOK - Published: 2004 - Publisher: Pearson Education

The best selling 'Algorithmics' presents the most important, concepts, methods and results that are fundamental to the science of computing. It starts by introd
Invitation to Fixed-Parameter Algorithms
Language: en
Pages: 316
Authors: Rolf Niedermeier
Categories: Mathematics
Type: BOOK - Published: 2006-02-02 - Publisher: OUP Oxford

This research-level text is an application-oriented introduction to the growing and highly topical area of the development and analysis of efficient fixed-param
Exact Exponential Algorithms
Language: en
Pages: 206
Authors: Fedor V. Fomin
Categories: Mathematics
Type: BOOK - Published: 2010-10-26 - Publisher: Springer Science & Business Media

For a long time computer scientists have distinguished between fast and slow algo rithms. Fast (or good) algorithms are the algorithms that run in polynomial ti