成功加入购物车
正版书籍 高温消毒 放心购买 17点前订单当天发货 书名于图片不符时以图片为准
[德] 斯基恩纳 (Steven S.Skiena) 著 / 清华大学出版社 / 2009-09 / 平装
售价 ¥ 168.22
品相 八五品
优惠 满包邮
延迟发货说明
上书时间2024-03-13
卖家超过10天未登录
算法设计手册
《算法设计手册(第2版)》是算法设计畅销书的最新版本,是设计实用且高效算法的最全面指导书。《算法设计手册(第2版)》揭密了算法的设计与分析,以简单易懂的写作风格,介绍了各种算法技术,着重强调了算法分析,全书包括两大部分,“技术”部分介绍了设计和分析计算机算法的各种方法,“资源”部分给出了大量的参考资源,以及算法实现的各种资源,此外,在作者的个人网址还提供了各种教学资源和参考材料,这些资源对读者很有参考价值。
《算法设计手册(第2版)》可以作为算法设计课程的主教材,也是程序人员、研究人员和学生的常备参考书。
ⅠPracticalAlgorithmDesign1IntroductiontoAlgorithmDesign1.1RobotTourOptimization1.2SelectingtheRightJobs1.3ReasoningaboutCorrectness1.4ModelingtheProblem1.5AbouttheWaxStories1.6WarStory:PsychicModeling1.7Exercises2AlgorithmAnalysis2.1TheRAMModelofComputation2.2TheBigOhNotation2.3GrowthRatesandDominanceRelations2.4WorkingwiththeBigOh2.5ReasoningAboutEfficiency2.6LogarithmsandTheirApplications2.7PropertiesofLogarithms2.8WarStory:MysteryofthePyramids2.9AdvancedAnalysis(*)2.10Exercises3DataStructures3.1Contiguousvs.LinkedDataStructures3.2StacksandQueues3.3Dictionaries3.4BinarySearchTrees3.5PriorityQueues3.6WarStory:StrippingTriangulations3.7HashingandStrings3.8SpecializedDataStructures3.9WarStory:StringemUp3.10Exercises4SortingandSearching4.1ApplicationsofSorting4.2PragmaticsofSorting4.3Heapsort:FastSortingviaDataStructures4.4WarStory:GivemeaTicketonanAirplane4.5Mergesort:SortingbyDivide-and-Conquer4.6Quicksort:SortingbyRandomization4.7DistributionSort:SortingviaBucketing4.8WarStory:SkienafortheDefense4.9BinarySearchandRelatedAlgorithms4.10Divide-and-Conquer4.11Exercises5GraphTraversal5.1FlavorsofGraphs5.2DataStructuresforGraphs5.3WarStory:IwasaVictimofMooresLaw5.4WarStory:GettingtheGraph5.5TraversingaGraph5.6Breadth-FirstSearch5.7ApplicationsofBreadth-FirstSearch5.8Depth-FirstSearch5.9ApplicationsofDepth-FirstSearch5.10Depth-FirstSearchonDirectedGraphs5.11Exercises6WeightedGraphAlgorithms6.1MinimumSpanningTrees6.2WarStory:NothingbutNets6.3ShortestPaths6.4WarStory:DialingforDocuments6.5NetworkFlowsandBipartiteMatching6.6DesignGraphs,NotAlgorithms6.7Exercises7CombinatorialSearchandHeuristicMethods7.1Backtracking7.2SearchPruning7.3Sudoku7.4WarStory:CoveringChessboards7.5HeuristicSearchMethods7.6WarStory:OnlyitisNotaRadio7.7WarStory:AnnealingArrays7.8OtherHeuristicSearchMethods7.9ParallelAlgorithms7.10WarStory:GoingNowhereFast7.11Exercises8DynamicProgramming8.1Cachingvs.Computation8.2ApproximateStringMatching8.3LongestIncreasingSequence8.4WarStory:EvolutionoftheLobster8.5ThePartitionProblem8.6ParsingContext-FreeGrammars8.7LimitationsofDynamicProgramming:TSP8.8WarStory:WhatsPastisProlog8.9WarStory:TextCompressionforBarCodes8.10Exercises9IntractableProblemsandApproximationAlgorithms9.1ProblemsandReductions9.2ReductionsforAlgorithms9.3ElementaryHardnessReductions..9.4Satisfiability9.5CreativeReductions9.6TheArtofProvingHardness9.7WarStory:HardAgainsttheClock9.8WarStory:AndThenIFailed9.9Pvs.NP9.10DealingwithNP-completeProblems9.11Exercises10HowtoDesignAlgorithmsⅡTheHitchhikersGuidetoAlgorithms11ACatalogofAlgorithmicProblems12DataStructures12.1Dictionaries12.2PriorityQueues12.3SuffixTreesandArrays12.4GraphDataStructures12.5SetDataStructures12.6Kd-Trees13NumericalProblems13.1SolvingLinearEquations13.2BandwidthReduction13.3MatrixMultiplication13.4DeterminantsandPermanents13.5ConstrainedandUnconstrainedOptimization13.6LinearProgramming13.7RandomNumberGeneration13.8FactoringandPrimalityTesting13.9Arbitrary-PrecisionArithmetic13.10KnapsackProblem13.11DiscreteFourierTransform14CombinatorialProblems14.1Sorting14.2Searching14.3MedianandSelection14.4GeneratingPermutations14.5GeneratingSubsets14.6GeneratingPartitions14.7GeneratingGraphs14.8CalendricalCalculations14.9JobScheduling14.10Satisfiability15GraphProblems:Polynomial-Time15.1ConnectedComponents15.2TopologicalSorting15.3MinimumSpanningTree15.4ShortestPath15.5TransitiveClosureandReduction15.6Matching15.7EulerianCycle/ChinesePostman15.8EdgeandVertexConnectivity15.9NetworkFlow15.10DrawingGraphsNicely15.11DrawingTrees15.12PlanarityDetectionandEmbedding16GraphProblems:HardProblems16.1Clique16.2IndependentSet16.3VertexCover16.4TravelingSalesmanProblem16.5HamiltonianCycle16.6GraphPartition16.7VertexColoring16.8EdgeColoring16.9GraphIsomorphism16.10SteinerTree16.11FeedbackEdge/VertexSet17ComputationalGeometry17.1RobustGeometricPrimitives17.2ConvexHull17.3Triangulation17.4VoronoiDiagrams17.5NearestNeighborSearch17.6RangeSearch17.7PointLocation17.8IntersectionDetection17.9BinPacking17.10Medial-AxisTransform17.11PolygonPartitioning17.12SimplifyingPolygons17.13ShapeSimilarity17.14MotionPlanning17.15MaintainingLineArrangements17.16MinkowskiSum18SetandStringProblems18.1SetCover18.2SetPacking18.3StringMatching18.4ApproximateStringMatching18.5TextCompression18.6Cryptography18.7FiniteStateMachineMinimization18.8LongestCommonSubstring/Subsequence18.9ShortestCommonSuperstring19AlgorithmicResources19.1SoftwareSystems19.2DataSources19.3OnlineBibliographicResources19.4ProfessionalConsultingServicesBibliography
展开全部
配送说明
...
相似商品
为你推荐
开播时间:09月02日 10:30