Type(s) de contenu et mode(s) de consultation : Texte noté : électronique

Auteur(s) : Skiena, Steven S.  Voir les notices liées en tant qu'auteur

Titre(s) : The algorithm design manual [Texte électronique] / Steven S. Skiena

Édition : 2nd ed.

Publication : London : Springer, cop. 2008

Description matérielle : 1 ressource dématérialisée

Note(s) : Previous edition: 1997. - Includes bibliographical references (pages 665-707) and index
This expanded and updated second edition of a classic bestseller continues to take the mystery out of designing and analyzing algorithms and their efficacy and efficiency. Expanding on the highly successful formula of the first edition, the book now serves as the primary textbook of choice for any algorithm design course while maintaining its status as the premier practical reference guide to algorithms. NEW: (1) Incorporates twice the tutorial material and exercises. (2) Provides full online support for lecturers, and a completely updated and improved website component with lecture slides, audio and video. (3) Contains a highly unique catalog of the 75 most important algorithmic problems. (4) Includes new war stories and interview problems, relating experiences from real-world applications. Unique, handy reference package with a practical, hands-on appeal to a wide audience This classic bestseller has been expanded and updated with twice the original tutorial material and exercises Contains a highly unique catalog of the 75 most important algorithmic problems Additional useful information such as lecture slides and updates available via author's website

Sujet(s) : Algorithmes -- Informatique  Voir les notices liées en tant que sujet
Algorithmes  Voir les notices liées en tant que sujet

Indice(s) Dewey :  005.1 (23e éd.) = Développement de logiciels  Voir les notices liées en tant que sujet

Identifiants, prix et caractéristiques : ISBN 9781848000704

Identifiant de la notice  : ark:/12148/cb44671499r

Notice n° :  FRBNF44671499 (notice reprise d'un réservoir extérieur)

Table des matières : I. Practical algorithm design ; Introduction to algorithm design -- ; Algorithm analysis -- ; Data structures -- ; Sorting and searching -- ; Graph traversal -- ; Weighted graph algorithms -- ; Combinatorial search and heuristic methods -- ; Dynamic programming -- ; Intractable problems and approximations -- ; How to design algorithms --II. The hitchhiker's guide to algorithms ; A catalog of algorithmic problems -- ; Numerical problems -- ; Combinatorial problems -- ; Graph problems: polynomial-time -- ; Graph problems: hard problems -- ; Computational geometry -- ; Set and string problems -- ; Algorithmic resources.