The Algorithm Design Manual
Springer Science & Business Media, 5. 4. 2009 - Počet stran: 730
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.
Další vydání - Zobrazit všechny
algorithm applications approximation array better binary called characters coloring complete components compute connected Consider construct contains convex cost cover cycle data structures defined deletion directed discussed distance edge efficient elements exactly example exist Figure flow function Give given graph G hard heuristic identify implementation important input insertion instance integer interesting length linear matching matrix maximum means method minimize Minkowski sum node Notes NP-complete objects operations optimal OUTPUT pair partition path performance permutations polygon position possible problem programming prove provides random reduction Related represent requires root seek sequence shortest path simple solution solve sorting space spanning string subset Suppose takes tree triangle vertex vertices weight