Design and Analysis of Algorithms (Fall, 2008)

Design and Analysis of Algorithms (Fall, 2008)

Follow Design and Analysis of Algorithms (Fall, 2008)

Share on

In this graduate class, UC Davis computer science professor Charles Martel describes advanced methods for the design and analysis of algorithms. He applies these techniques to design fast solutions for a wide range of applications including scheduling, network routing, computational biology, resourc…

Charles U. Martel

Jan 20, 2009 LATEST EPISODE
infrequent NEW EPISODES
1h 20m AVG DURATION
18 EPISODES

Search for episodes from Design and Analysis of Algorithms (Fall, 2008) with a specific topic:

Latest episodes from Design and Analysis of Algorithms (Fall, 2008)

Local search (12.1); simulated annealing (brief) (12.2)

Play Episode Listen Later Jan 20, 2009 78:24

simulated local search annealing

Randomized Max-SAT (13.4); universal hashing (13.6); perfect hashing (CLRS 11.5)

Play Episode Listen Later Jan 20, 2009 81:53

universal randomized hashing

Closest point (13.7); introduction to primality testing

Play Episode Listen Later Jan 20, 2009 80:23

testing closest

Primality testing (see Cormen, Leiserson, Rivest 31.8)

Play Episode Listen Later Jan 20, 2009 57:45

Midterm solutions

Play Episode Listen Later Jan 20, 2009 80:06

Set cover finished (11.3); weighted vertex cover 11.4

Play Episode Listen Later Jan 20, 2009 83:13

finished weighted vertex

Linear programming/integer programming

Play Episode Listen Later Jan 20, 2009 82:04

programming linear integer

Approximations for: disjoint paths 11.5, 11.8 knapsack

Play Episode Listen Later Jan 20, 2009 82:29

Pspace (9.1,9.2); dealing with hard problems

Play Episode Listen Later Jan 20, 2009 81:44

10.2 Independent set; approximations: vertex cover, scheduling 11.1

Play Episode Listen Later Jan 20, 2009 75:39

independent scheduling vertex

Hard problems: NP, decision vs. optimization, subset sum reductions

Play Episode Listen Later Jan 20, 2009 84:42

decision optimization reductions hard problems subset

Advanced graph algorithms

Play Episode Listen Later Jan 20, 2009 83:52

algorithms graphs

Network flow applications

Play Episode Listen Later Jan 20, 2009 80:47

network applications

Finish 6.5; sequence alignment (6.6); linear space (6.7)

Play Episode Listen Later Jan 16, 2009 85:01

space finish linear sequence alignment

Linear space analysis (6.7); shortest paths (6.8-6.9, bit of 6.10)

Play Episode Listen Later Jan 16, 2009 81:58

space paths linear shortest

Introduction: Types of analysis

Play Episode Listen Later Jan 16, 2009 83:21

Network Flows (7.1, 7.2): Problem definition, residual graphs, Ford-Fulkerson algorithm

Play Episode Listen Later Jan 16, 2009 81:45

network definition algorithms flows graphs residual fulkerson

Network flows: Scaling algorithm, application to bipartite matching, disjoint paths (7.3, 7.5, 7.6)

Play Episode Listen Later Jan 16, 2009 81:33

network application scaling algorithms paths matching flows

Claim Design and Analysis of Algorithms (Fall, 2008)

In order to claim this podcast we'll send an email to with a verification link. Simply click the link and you will be able to edit tags, request a refresh, and other features to take control of your podcast page!