课程目录

• 1.[1.1.1]–Introduction
• 10.[3.4.1]–ConnectivityinDirectedGraphs
• 11.[3.5.1]–DAGandTopologicalOrdering
• 12.[4.1.1]–CoinChanging
• 13.[4.2.1]–IntervalScheduling
• 14.[4.3.1]–IntervalPartitioning
• 15.[4.4.1]–SchedulingtoMinimizeLateness
• 16.[4.5.1]–OptimalCaching
• 17.[4.6.1]–ShortestPathsinaGraph
• 18.[4.7.1]–MinimumSpanningTree
• 19.[4.8.1]–CorrectnessofAlgorithms
• 2.[1.3.1]–Gale-ShapleyAlgorithm
• 20.[4.9.1]–Clustering
• 21.[5.1.1]–Mergesort
• 22.[5.2.1]–CountingInversions
• 23.[5.3.1]–ClosestPairofPoints
• 24.[5.4.1]–IntegerMultiplication
• 25.[5.5.1]–5.5MatrixMultiplication
• 26.[5.6.1]–ConvolutionandFFT
• 27.[5.7.1]–FFT
• 28.[5.8.1]–InverseDFT
• 29.[6.1.1]–WeightedIntervalScheduling
• 3.[1.4.1]–UnderstandingGale-ShapleyAlgo
• 30.[6.2.1]–SegmentedLeastSquares
• 31.[6.3.1]–KnapsackProblem
• 32.[6.4.1]–RNASecondaryStructure
• 33.[6.5.1]–SequenceAlignment
• 34.[6.6.1]–ShortestPaths
• 35.[7.1.1]–FlowsandCuts
• 36.[7.2.1]–MinimumCutandMaximumFlow
• 37.[7.3.1]–Ford-FulkersonAlgorithm
• 38.[7.4.1]–ChoosingGoodAugmentingPaths
• 39.[7.5.1]–BipartiteMatching
• 4.[2.1.1]–ComputationalTractability
• 40.[8.1.1]–Polynomial-TimeReductions
• 41.[8.2.1]–BasicReductionStrategiesI
• 42.[8.3.1]–BasicReductionStrategiesII
• 43.[8.4.1]–DefinitionofNP
• 44.[8.5.1]–ProblemsinNP
• 45.[8.6.1]–NP-Completeness
• 46.[8.7.1]–SequencingProblems
• 47.[8.8.1]–NumericalProblems
• 48.[8.9.1]–co-NPandtheAsymmetryofNP
• 49.[9.1.1]–LoadBalancing
• 5.[2.2.1]–AsymptoticOrderofGrowth
• 50.[9.2.1]–CenterSelection
• 51.[9.3.1]–ThePricingMethodVertexCover
• 52.[9.4.1]–LPRoundingVertexCover
• 53.[9.5.1]–KnapsackProblem
• 54.[10.1.1]–LandscapeofanOptimizationPr
• 55.[10.2.1]–MaximumCut
• 56.[10.3.1]–NashEquilibria
• 57.[10.4.1]–PriceofStability
• 58.[11.1.1]–ContentionResolution
• 59.[11.2.1]–LinearityofExpectation
• 6.[2.3.1]–ASurveyofCommonRunningTimes
• 60.[11.3.1]–MAX3-SAT
• 61.[11.4.1]–ChernoffBounds
• 7.[3.1.1]–BasicDefinitionsandApplicatio
• 8.[3.2.1]–GraphTraversal
• 9.[3.3.1]–TestingBipartiteness