算法设计手册第2版

图书标准信息

• 作者 [德]斯基恩纳（Steven S.Skiena） 著
• 出版社 清华大学出版社
• 出版时间 2009-09
• 版次 1
• ISBN 9787302207276
• 定价 69.00元
• 装帧 平装
• 开本 16开
• 纸张 胶版纸
• 页数 706页
• 正文语种 简体中文，英语
• 原版书名 The Algorithm Design Manual (2nd Ed.)

【内容简介】

《算法设计手册（第2版）》是算法设计畅销书的最新版本，是设计实用且高效算法的最全面指导书。《算法设计手册（第2版）》揭密了算法的设计与分析，以简单易懂的写作风格，介绍了各种算法技术，着重强调了算法分析，全书包括两大部分，“技术”部分介绍了设计和分析计算机算法的各种方法，“资源”部分给出了大量的参考资源，以及算法实现的各种资源，此外，在作者的个人网址还提供了各种教学资源和参考材料，这些资源对读者很有参考价值。
《算法设计手册（第2版）》可以作为算法设计课程的主教材，也是程序人员、研究人员和学生的常备参考书。

【目录】

ⅠPracticalAlgorithmDesign
1IntroductiontoAlgorithmDesign
1.1RobotTourOptimization
1.2SelectingtheRightJobs
1.3ReasoningaboutCorrectness
1.4ModelingtheProblem
1.5AbouttheWaxStories
1.6WarStory：PsychicModeling
1.7Exercises

2AlgorithmAnalysis
2.1TheRAMModelofComputation
2.2TheBigOhNotation
2.3GrowthRatesandDominanceRelations
2.4WorkingwiththeBigOh
2.5ReasoningAboutEfficiency
2.6LogarithmsandTheirApplications
2.7PropertiesofLogarithms
2.8WarStory：MysteryofthePyramids
2.9AdvancedAnalysis(*)
2.10Exercises

3DataStructures
3.1Contiguousvs.LinkedDataStructures
3.2StacksandQueues
3.3Dictionaries
3.4BinarySearchTrees
3.5PriorityQueues
3.6WarStory：StrippingTriangulations
3.7HashingandStrings
3.8SpecializedDataStructures
3.9WarStory：StringemUp
3.10Exercises

4SortingandSearching
4.1ApplicationsofSorting
4.2PragmaticsofSorting
4.3Heapsort：FastSortingviaDataStructures
4.4WarStory：GivemeaTicketonanAirplane
4.5Mergesort：SortingbyDivide-and-Conquer
4.6Quicksort：SortingbyRandomization
4.7DistributionSort：SortingviaBucketing
4.8WarStory：SkienafortheDefense
4.9BinarySearchandRelatedAlgorithms
4.10Divide-and-Conquer
4.11Exercises

5GraphTraversal
5.1FlavorsofGraphs
5.2DataStructuresforGraphs
5.3WarStory：IwasaVictimofMooresLaw
5.4WarStory：GettingtheGraph
5.5TraversingaGraph
5.6Breadth-FirstSearch
5.7ApplicationsofBreadth-FirstSearch
5.8Depth-FirstSearch
5.9ApplicationsofDepth-FirstSearch
5.10Depth-FirstSearchonDirectedGraphs
5.11Exercises

6WeightedGraphAlgorithms
6.1MinimumSpanningTrees
6.2WarStory：NothingbutNets
6.3ShortestPaths
6.4WarStory：DialingforDocuments
6.5NetworkFlowsandBipartiteMatching
6.6DesignGraphs，NotAlgorithms
6.7Exercises

7CombinatorialSearchandHeuristicMethods
7.1Backtracking
7.2SearchPruning
7.3Sudoku
7.4WarStory：CoveringChessboards
7.5HeuristicSearchMethods
7.6WarStory：OnlyitisNotaRadio
7.7WarStory：AnnealingArrays
7.8OtherHeuristicSearchMethods
7.9ParallelAlgorithms
7.10WarStory：GoingNowhereFast
7.11Exercises

8DynamicProgramming
8.1Cachingvs.Computation
8.2ApproximateStringMatching
8.3LongestIncreasingSequence
8.4WarStory：EvolutionoftheLobster
8.5ThePartitionProblem
8.6ParsingContext-FreeGrammars
8.7LimitationsofDynamicProgramming：TSP
8.8WarStory：WhatsPastisProlog
8.9WarStory：TextCompressionforBarCodes
8.10Exercises

9IntractableProblemsandApproximationAlgorithms
9.1ProblemsandReductions
9.2ReductionsforAlgorithms
9.3ElementaryHardnessReductions..
9.4Satisfiability
9.5CreativeReductions
9.6TheArtofProvingHardness
9.7WarStory：HardAgainsttheClock
9.8WarStory：AndThenIFailed
9.9Pvs.NP
9.10DealingwithNP-completeProblems
9.11Exercises

10HowtoDesignAlgorithms

ⅡTheHitchhikersGuidetoAlgorithms
11ACatalogofAlgorithmicProblems
12DataStructures
12.1Dictionaries
12.2PriorityQueues
12.3SuffixTreesandArrays
12.4GraphDataStructures
12.5SetDataStructures
12.6Kd-Trees

13NumericalProblems
13.1SolvingLinearEquations
13.2BandwidthReduction
13.3MatrixMultiplication
13.4DeterminantsandPermanents
13.5ConstrainedandUnconstrainedOptimization
13.6LinearProgramming
13.7RandomNumberGeneration
13.8FactoringandPrimalityTesting
13.9Arbitrary-PrecisionArithmetic
13.10KnapsackProblem
13.11DiscreteFourierTransform

14CombinatorialProblems
14.1Sorting
14.2Searching
14.3MedianandSelection
14.4GeneratingPermutations
14.5GeneratingSubsets
14.6GeneratingPartitions
14.7GeneratingGraphs
14.8CalendricalCalculations
14.9JobScheduling
14.10Satisfiability

15GraphProblems：Polynomial-Time
15.1ConnectedComponents
15.2TopologicalSorting
15.3MinimumSpanningTree
15.4ShortestPath
15.5TransitiveClosureandReduction
15.6Matching
15.7EulerianCycle/ChinesePostman
15.8EdgeandVertexConnectivity
15.9NetworkFlow
15.10DrawingGraphsNicely
15.11DrawingTrees
15.12PlanarityDetectionandEmbedding

16GraphProblems：HardProblems
16.1Clique
16.2IndependentSet
16.3VertexCover
16.4TravelingSalesmanProblem
16.5HamiltonianCycle
16.6GraphPartition
16.7VertexColoring
16.8EdgeColoring
16.9GraphIsomorphism
16.10SteinerTree
16.11FeedbackEdge/VertexSet

17ComputationalGeometry
17.1RobustGeometricPrimitives
17.2ConvexHull
17.3Triangulation
17.4VoronoiDiagrams
17.5NearestNeighborSearch
17.6RangeSearch
17.7PointLocation
17.8IntersectionDetection
17.9BinPacking
17.10Medial-AxisTransform
17.11PolygonPartitioning
17.12SimplifyingPolygons
17.13ShapeSimilarity
17.14MotionPlanning
17.15MaintainingLineArrangements
17.16MinkowskiSum

18SetandStringProblems
18.1SetCover
18.2SetPacking
18.3StringMatching
18.4ApproximateStringMatching
18.5TextCompression
18.6Cryptography
18.7FiniteStateMachineMinimization
18.8LongestCommonSubstring/Subsequence
18.9ShortestCommonSuperstring

19AlgorithmicResources
19.1SoftwareSystems
19.2DataSources
19.3OnlineBibliographicResources
19.4ProfessionalConsultingServices
Bibliography