学堂在线-算法设计与分析-清华大学

39.[7.5.1]--BipartiteMatching【持续更新‖免费提供：CunworknoteS】.mp4  [45.2 MB]
20.[4.9.1]--Clustering【整理不易‖记得关注：CunWorKNotes】.mp4  [35.6 MB]
51.[9.3.1]--ThePricingMethodVertexCover.mp4  [44.8 MB]
25.[5.5.1]--5.5MatrixMultiplication.mp4  [43.0 MB]
16.[4.5.1]--OptimalCaching【更多精选‖公众号：CunWorknotes】  .mp4  [70.3 MB]
15.[4.4.1]--SchedulingtoMinimizeLateness.mp4  [46.3 MB]
9.[3.3.1]--TestingBipartiteness【不易整理‖请关注：CunWorkNoteS】.mp4  [31.1 MB]
60.[11.3.1]--MAX3-SAT.mp4  [50.8 MB]
49.[9.1.1]--LoadBalancing【更多精选‖公众号：CunWorknotes】  .mp4  [87.4 MB]
14.[4.3.1]--IntervalPartitioning.mp4  [24.8 MB]
13.[4.2.1]--IntervalScheduling.mp4  [45.1 MB]
27.[5.7.1]--FFT.mp4  [39.5 MB]
31.[6.3.1]--KnapsackProblem.mp4  [54.7 MB]
4.[2.1.1]--ComputationalTractability【更多精选‖公众号：CunWorknotes】  .mp4  [29.9 MB]
32.[6.4.1]--RNASecondaryStructure【整理不易‖记得关注：CunWorKNotes】.mp4  [66.8 MB]
5.[2.2.1]--AsymptoticOrderofGrowth【公重号：CunWorkNotes】.mp4  [35.1 MB]
40.[8.1.1]--Polynomial-TimeReductions【不易整理‖请关注：CunWorkNoteS】.mp4  [46.2 MB]
50.[9.2.1]--CenterSelection【优质资源‖关注：cunWorkNotes 解锁】.mp4  [57.9 MB]
26.[5.6.1]--ConvolutionandFFT.mp4  [56.8 MB]
36.[7.2.1]--MinimumCutandMaximumFlow【优质资源‖关注：cunWorkNotes 解锁】.mp4  [34.1 MB]
19.[4.8.1]--CorrectnessofAlgorithms.mp4  [38.6 MB]
28.[5.8.1]--InverseDFT.mp4  [35.5 MB]
58.[11.1.1]--ContentionResolution.mp4  [50.6 MB]
35.[7.1.1]--FlowsandCuts.mp4  [18.0 MB]
55.[10.2.1]--MaximumCut.mp4  [51.3 MB]
34.[6.6.1]--ShortestPaths.mp4  [43.4 MB]
24.[5.4.1]--IntegerMultiplication.mp4  [31.7 MB]
23.[5.3.1]--ClosestPairofPoints.mp4  [58.2 MB]
8.[3.2.1]--GraphTraversal.mp4  [33.7 MB]
61.[11.4.1]--ChernoffBounds.mp4  [38.4 MB]
48.[8.9.1]--co-NPandtheAsymmetryofNP.mp4  [23.7 MB]
59.[11.2.1]--LinearityofExpectation.mp4  [40.1 MB]
17.[4.6.1]--ShortestPathsinaGraph.mp4  [51.4 MB]
3.[1.4.1]--UnderstandingGale-ShapleyAlgo.mp4  [50.2 MB]
18.[4.7.1]--MinimumSpanningTree.mp4  [40.9 MB]
33.[6.5.1]--SequenceAlignment.mp4  [48.1 MB]
42.[8.3.1]--BasicReductionStrategiesII.mp4  [58.0 MB]
57.[10.4.1]--PriceofStability.mp4  [60.0 MB]
10.[3.4.1]--ConnectivityinDirectedGraphs.mp4  [30.7 MB]
12.[4.1.1]--CoinChanging.mp4  [41.7 MB]
22.[5.2.1]--CountingInversions.mp4  [52.4 MB]
38.[7.4.1]--ChoosingGoodAugmentingPaths.mp4  [58.0 MB]
47.[8.8.1]--NumericalProblems.mp4  [57.1 MB]
54.[10.1.1]--LandscapeofanOptimizationPr.mp4  [27.9 MB]
7.[3.1.1]--BasicDefinitionsandApplicatio.mp4  [55.8 MB]
37.[7.3.1]--Ford-FulkersonAlgorithm.mp4  [65.2 MB]
6.[2.3.1]--ASurveyofCommonRunningTimes.mp4  [46.7 MB]
45.[8.6.1]--NP-Completeness.mp4  [42.7 MB]
29.[6.1.1]--WeightedIntervalScheduling.mp4  [79.9 MB]
2.[1.3.1]--Gale-ShapleyAlgorithm.mp4  [43.2 MB]
56.[10.3.1]--NashEquilibria.mp4  [42.5 MB]
44.[8.5.1]--ProblemsinNP.mp4  [51.3 MB]
1.[1.1.1]--Introduction.mp4  [36.4 MB]
21.[5.1.1]--Mergesort.mp4  [74.8 MB]
53.[9.5.1]--KnapsackProblem.mp4  [93.3 MB]
52.[9.4.1]--LPRoundingVertexCover.mp4  [49.5 MB]
46.[8.7.1]--SequencingProblems.mp4  [76.1 MB]
11.[3.5.1]--DAGandTopologicalOrdering.mp4  [59.6 MB]
43.[8.4.1]--DefinitionofNP.mp4  [40.7 MB]
30.[6.2.1]--SegmentedLeastSquares.mp4  [38.1 MB]
41.[8.2.1]--BasicReductionStrategiesI.mp4  [47.4 MB]