算法设计与分析

课程目标：

本课程系统介绍算法设计与分析的方法和理论，包括算法基础、图、贪婪算法、分治、动态规划、网络流、计算复杂性初步、近似算法及随机算法等。同时，本课程还包含算法领域的一些前沿课题和最新进展。本课程可以作为数学、计算机等相关专业的研究生和高年级本科生关于算法理论的基础课程。

课程截图：

〖课程目录〗:

• | └──12、算法设计与分析(2019秋)
• | | ├──{10}–10LocalSearch
• | | | ├──{1}–10.1LandscapeofanOptimizationPro
• | | | ├──{2}–10.2MaximumCut
• | | | ├──{3}–10.3NashEquilibria
• | | | └──{4}–10.4PriceofStability
• | | ├──{11}–11RandomizedAlgorithms
• | | | ├──{1}–11.1ContentionResolution
• | | | ├──{2}–11.2LinearityofExpectation
• | | | ├──{3}–11.3MAX3-SAT
• | | | └──{4}–11.4ChernoffBounds
• | | ├──{1}–1IntroductionofAlgorithm
• | | | ├──{1}–1.1Introduction
• | | | ├──{2}–1.2AFirstProblemStableMatching
• | | | ├──{3}–1.3Gale-ShapleyAlgorithm
• | | | └──{4}–1.4UnderstandingGale-ShapleyAlgo
• | | ├──{2}–2BasicsofAlgorithmAnalysis
• | | | ├──{1}–2.1ComputationalTractability
• | | | ├──{2}–2.2AsymptoticOrderofGrowth
• | | | └──{3}–2.3ASurveyofCommonRunningTimes
• | | ├──{3}–3Graph
• | | | ├──{1}–3.1BasicDefinitionsandApplicatio
• | | | ├──{2}–3.2GraphTraversal
• | | | ├──{3}–3.3TestingBipartiteness
• | | | ├──{4}–3.4ConnectivityinDirectedGraphs
• | | | └──{5}–3.5DAGandTopologicalOrdering
• | | ├──{4}–4GreedyAlgorithms
• | | | ├──{1}–4.1CoinChanging
• | | | ├──{2}–4.2IntervalScheduling
• | | | ├──{3}–4.3IntervalPartitioning
• | | | ├──{4}–4.4SchedulingtoMinimizeLateness
• | | | ├──{5}–4.5OptimalCaching
• | | | ├──{6}–4.6ShortestPathsinaGraph
• | | | ├──{7}–4.7MinimumSpanningTree
• | | | ├──{8}–4.8CorrectnessofAlgorithms
• | | | └──{9}–4.9Clustering
• | | ├──{5}–5DivideandConquer
• | | | ├──{1}–5.1Mergesort
• | | | ├──{2}–5.2CountingInversions
• | | | ├──{3}–5.3ClosestPairofPoints
• | | | ├──{4}–5.4IntegerMultiplication
• | | | ├──{5}–5.5MatrixMultiplication
• | | | ├──{6}–5.6ConvolutionandFFT
• | | | ├──{7}–5.7FFT
• | | | └──{8}–5.8InverseDFT
• | | ├──{6}–6DynamicProgramming
• | | | ├──{1}–6.1WeightedIntervalScheduling
• | | | ├──{2}–6.2SegmentedLeastSquares
• | | | ├──{3}–6.3KnapsackProblem
• | | | ├──{4}–6.4RNASecondaryStructure
• | | | ├──{5}–6.5SequenceAlignment
• | | | └──{6}–6.6ShortestPaths
• | | ├──{7}–7NetworkFlow
• | | | ├──{1}–7.1FlowsandCuts
• | | | ├──{2}–7.2MinimumCutandMaximumFlow
• | | | ├──{3}–7.3Ford-FulkersonAlgorithm
• | | | ├──{4}–7.4ChoosingGoodAugmentingPaths
• | | | └──{5}–7.5BipartiteMatching
• | | ├──{8}–8NPandComputationalIntractabilit
• | | | ├──{1}–8.1Polynomial-TimeReductions
• | | | ├──{2}–8.2BasicReductionStrategiesI
• | | | ├──{3}–8.3BasicReductionStrategiesII
• | | | ├──{4}–8.4DefinitionofNP
• | | | ├──{5}–8.5ProblemsinNP
• | | | ├──{6}–8.6NP-Completeness
• | | | ├──{7}–8.7SequencingProblems
• | | | ├──{8}–8.8NumericalProblems
• | | | └──{9}–8.9co-NPandtheAsymmetryofNP
• | | └──{9}–9ApproximationAlgorithms
• | | | ├──{1}–9.1LoadBalancing
• | | | ├──{2}–9.2CenterSelection
• | | | ├──{3}–9.3ThePricingMethodVertexCover
• | | | ├──{4}–9.4LPRoundingVertexCover
• | | | └──{5}–9.5KnapsackProblem

yeyudao普通

收藏 海报 链接