The Algorithm Design Manual
Springer Nature, 05.10.2020 - 793 Seiten
Most professional programmers that I’ve encountered are not well prepared to tacklealgorithmdesignproblems.Thisisapity,becausethetechniquesofalgorithm design form one of the core practical technologies of computer science. Designing correct, e?cient, and implementable algorithms for real-world problems requires access to two distinct bodies of knowledge: • Techniques – Good algorithm designers understand several fundamental - gorithm design techniques, including data structures, dynamic programming, depth-?rst search, backtracking, and heuristics. Perhaps the single most - portantdesigntechniqueismodeling,theartofabstractingamessyreal-world application into a clean problem suitable for algorithmic attack. • Resources – Good algorithm designers stand on the shoulders of giants. Ratherthanlaboringfromscratchtoproduceanewalgorithmforeverytask, they can ?gure out what is known about a particular problem. Rather than re-implementing popular algorithms from scratch, they seek existing imp- mentations to serve as a starting point. They are familiar with many classic algorithmic problems, which provide su?cient 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.
Andere Ausgaben - Alle anzeigen
algorithm applications array better called characters coloring complete components compute connected Consider construct contains convex correct cost cover cycle data structure defined deletion described directed discussed distance edge efficient elements exactly example exist Figure function Give given graph G hard hash heuristic identify implementation important Input insertion instance integer interesting least length linear look matching matrix maximum means methods Minkowski sum multiplication node Notes objects operations optimal Output pair partition path performance permutations polygon position possible probability problem prove provides random recursive reduce Related represent requires root running satisfiability seek sequence simple smallest solution solve sorting space spanning tree string subset Suppose takes tree triangle vertex vertices weight