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
Release Date
ISBN 9783642079092
Pages 538 pages
Rating 4/5 (91 users)

More Books:

Algorithmics for Hard Problems
Language: en
Pages: 538
Authors: Juraj Hromkovič
Categories: Computers
Type: BOOK - Published: 2010-12-09 - Publisher: Springer

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: 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.
Approximation Algorithms for NP-hard Problems
Language: en
Pages: 632
Authors: 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
Fixed-Parameter Linear-Time Algorithms for NP-hard Graph and Hypergraph Problems Arising in Industrial Applications
Language: en
Pages: 229
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
Theoretical Computer Science
Language: en
Pages: 336
Authors: Juraj Hromkovič
Categories: Computers
Type: BOOK - Published: 2003-09-18 - Publisher: Springer Science & Business Media

Juraj Hromkovic takes the reader on an elegant route through the theoretical fundamentals of computer science. The author shows that theoretical computer scienc
Approximation Algorithms
Language: en
Pages: 408
Authors: Vijay V. Vazirani
Categories: Computers
Type: BOOK - Published: 2002-12-05 - Publisher: Springer Science & Business Media

Covering the basic techniques used in the latest research work, the author consolidates progress made so far, including some very recent and promising results,
Parallel Algorithms for Irregular Problems: State of the Art
Language: en
Pages: 338
Authors: Alfonso Ferreira
Categories: Computers
Type: BOOK - Published: 2013-04-17 - Publisher: Springer Science & Business Media

Efficient parallel solutions have been found to many problems. Some of them can be obtained automatically from sequential programs, using compilers. However, th
Algorithmics
Language: en
Pages: 540
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
Problems on Algorithms
Language: en
Pages: 519
Authors: Habib Izadkhah
Categories: Computers
Type: BOOK - Published: 2022-12-03 - Publisher: Springer Nature

With approximately 2500 problems, this book provides a collection of practical problems on the basic and advanced data structures, design, and analysis of algor