标题：算法设计手册
基本信息
ISBN：9787302207276
定价：69元
印次：1-1
装帧：平装
印刷日期：2009-9-7
图书简介
本书是算法设计畅销书的最新版本，是设计实用且高效算法的最全面指导书。本书揭密了算法的设计与分析，以简单易懂的写作风格，介绍了各种算法技术，着重强调了算法分析，全书包括两大部分，“技术”部分介绍了设计和分析计算机算法的各种方法，“资源”部分给出了大量的参考资源，以及算法实现的各种资源，还提供了各种教学资源和参考材料，这些资源对读者很有参考价值。
本书可以作为算法设计课程的主教材，也是程序人员、研究人员和学生的常备参考书。
书籍目录
031140-01.txt
11roductiontoAlgorithmDesign3
1．IRobothurOptimization…………………．5
1．ZSelectingtheRigMJobs…………………．．9
1．3ReasoningaboutCorrectness………………．．11
1．4ModelingtheProblem……………………19
1．SAbouttherstories……………………22
1．6rstOYy：PSyChiCMOd6lillg………………．．23
1．7Exercises…………………………．．27
2AlgorithmAnalysis31
2．ITheRAMModelofComputation………………31
2．ZTheBigohNotation……………………．34
2．3GrowthRatesandDomlnanceRelatlons…………．．37
2．4WorkingwiththeBigOh…………………．40
2．SReasoningAboutEfficiency…………………41
2．6LogarithmsandTheirApplications……………．．46
2．7ProPertiesofLogarithms…………………．．50
2．8rstory：MysteryofthePyramids……………．51
2．9Ad、ncedAnalysis（”）……………………54
2．10Exercises…………………………．．57
3Datastructures65
3．IContlguousvs．LlnhdDataStructures……………66
xiiCONTENTS
3．2StacksandQueues……………………．．71
3．3Dictionaries…………………………72
3．4Blnarysearchlees……………………．．77
3．SPriorityQueues………………………．83
3．6rstory：Strippingliangulations……………．85
3．7Hashingandstrings……………………．89
3．SSpecializedDatastructures…………………93
3．9rStory：String’e：Up3．10Exercises…………………………．．98
4Sortingandsearching103
4．IAPPlicationsofsorting……………………104
4．2Pragmaticsofsorting……………………．107
4．3H6&PSOFt：kstSOftlllgV18D8t8StfllCtllY6S…………108
4．4VrStory：GIVemeaTicktonallAirPlalle………．．118
4．SM6fg6SOft：SOftlllgbyDIVld6－llld－COllqll6ll…………120
4．6Qulcksort：SortingbyRandomization……………123
4．7DIStyiblltiollSOYt：SOYtillgVi8BllChtillg…………．．129
4．8rstory：SkienafortheDefense……………．．131
4．9BlnarySearchandRelatedAlgorithms……………132
4．10Divide－and－Conquer……………………．．135
4．11Exercises…………………………．．139
SGraphThaversal145
5．IFlavorsofGraphs………………………146
5．ZDatastructuresforGraphs…………………151
5．3rStofy：IWSS8VICtithOfMOOW6’SL8iYV…………155
5．4rStory：GettingtheG：anh………………．．158
5．slaversingaGraph……………………．．161
5．6Breadth－Firstsearch……………………．162
5．7ApplicationsofBreadth－FirstSearch……………．166
5．SDepth－Firstsearch……………………．．169
5．9ApplicationsofDepth－FirstSearch……………．．172
5．10Depth－FirstSearchonDirectedGraphs…………．．178
5．11EXer…………………………．．184
6WeightedGraphAlgorithmslgl
6．IMlnlmumSPanninglees…………………．192
6．2WaYStory：NOthillgbutNetS………………．．202
6．3ShortestPaths………………………．．205
6．4WarStcry：DialingforDocumes……………．．212
6．5NetworkFlowsandBipartiteMatching…………．．217
6．6DeslgnGraPhs，NotAlgorithms………………．222
6．7Exercises…………………………．．225
CONTENTSxiii
7．IBacktraching…………………………231
7．2SearchPruning………………………．238
7．3Sud。ku……………………………239
7．4rstory：CoveringChessboards………………244
7．SHeuristicsearchMethods…………………．247
7．6WafStofy：OillyitisNOtfiR3diO……………．．260
7．7rstory：AnnealingArrs………………．．263
7．SOtherHeuristicsearchMethods………………266
7．9Parallelorithms……………………．．267
7．10rStory：GoingNowherekst………………．268
7．11Exercises…………………………．．270
SDgnamlcProgramming273
8．ICachingvs．Computation…………………．274
8．ZAPProxlmatestringMatching………………．．280
8．3Lngestlncreasingsequence…………………289
8．4rstory：EvolutionoftheLobster……………．291
8．SThePartitionProblem……………………294
8．6ParsingCoext一eeGrammars………………298
8．7LlmltatlonsofDynamicProgramming：TSP…………301
8．8rStofy：Whst’SPSStisPfolog………………304
8．9rStory：IXtCompressionforBarCodes………．．307
8．10Exercises…………………………．．310
9．IProblemsandReductions…………………．317
9．ZReductionsforAlgorithms…………………．319
9．3ElementaryHardnessReductions………………323
9．4Satisfiability…………………………328
9．SCreatlVeReductiolls……………………．330
9．6TheArtofProvingHardness………………．．334
9．7rStory：HardAgainsttheCIcCk……………．．337
9．8WarSy：AndThenlFailed………………．．339
9．9P．…………………………．．
9．10DealingwithNP－completeProblems……………．344
9．11Exercises…………………………．．350
10HowtoDesignAlgorithms356
11TheHitchhiker’sGuidetoAlgorithms361
11ACatalogofAlgorithmicProblems363
.
xlvCONTENTS
12DataStructures366
12.IDictionaries..............................367
12.ZPriorityQueues......'.....................373
12'3SuffixTreesandArrays........................377
12'4GraphData
CONTENTSxv
15.1IDracingTrees.............................517
15'12PlanaritvDetectionandEmbedding520
JDetectionandEmbedding................520
16GraphProblems:HardProblems523
16.ICIique...............................25
16.ZIndependeniSet............................528
16.3VertexCover..............................530
16.4TraillingSalesmanProblem.....................533
16.SHamiItonianCyc1e..........................538
16.6Graphpartition............................541
16.7VertexCoIoring............................544
16.SEdgeCoIoring.............................548
16'9Graph
.
xviCONTENTS
19AlgorithmicResources657
19.ISofiwareSystems...........................657
l9.ZDataSources..............................663
19'3OnlineBibliographicResources...................663
19.4ProfessionalConsultingServices...................664
Bibliography665
Index709[1]