The Algorithm Design Manual - Rilegato

Skiena, Steven S.

 
9780387948607: The Algorithm Design Manual
Rilegato
ISBN 10: 0387948600 ISBN 13: 9780387948607
Casa editrice: Telos Pr, 1997

Sinossi

Most professional programmers that I’ve encountered are not well prepared to tackle algorithm design problems. This is a pity, because the techniques of algorithm design form one of the core practical technologies of computer science. Designing correct, efficient, and implementable algorithms for real-world problems requires access to two distinct bodies of knowledge: • Techniques – Good algorithm designers understand several fundamental algorithm design techniques, including data structures, dynamic programming, depth first search, backtracking, and heuristics. Perhaps the single most important design technique is modeling, the art of abstracting a messy real-world application into a clean problem suitable for algorithmic attack. • Resources – Good algorithm designers stand on the shoulders of giants. Rather than laboring from scratch to produce a new algorithm for every task, they can figure out what is known about a particular problem. Rather than re-implementing popular algorithms from scratch, they seek existing implementations to serve as a starting point. They are familiar with many classic algorithmic problems, which provide sufficient source material to model most any application. This book is intended as a manual on algorithm design, providing access to combinatorial algorithm technology for both students and computer professionals.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Recensione

"...the book is an algorithm implementation treasure trove, and putting all of these implementations in one place was no small feat. The list of implementations, an extensive bibliography, and the CD-ROM make the book an invaluable resource for everyone interested in the subject." --ACM Computing Reviews

Contenuti

Part I: Techniques 1) Introduction to Algorithms; 2) Data Structures and Sorting; 3) Breaking Problems Down; 4) Graph Algorithms; 5) Combinatorial Search and Heuristic Methods; 6) Intractable Problems and Approximations; 7) How to Design Algorithms Part II: Resources 8) A Catalog of Algorithmic Problems; 9) Algorithmic Resources

Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.

Editore
Telos Pr
Data di pubblicazione
1997
Lingua
Inglese
ISBN 10 
0387948600
ISBN 13 
9780387948607
Rilegatura
Copertina rigida
Numero edizione
2
Numero di pagine
486
Contatto del produttore
non disponibile
Persona responsabile
CMN Printpool Inh. Mathis Neumann
https://www.also.com/ec/cms5/en_6000/6000/index.jsp

Friedrich-Karl-Str. 9
Hamburg
Germania