Algorithms for Data Science
CSOR W4246
Eleni Drinea
Computer Science Department
Columbia University
October 20-22, 2015
Outline
1 Recap
2 Flow networks
Applications
3 The residual graph and augmenting paths
4 The Ford-Fulkerson algorithm for max ow
5 Corr
Algorithms for Data Science
CSOR W4246
Eleni Drinea
Computer Science Department
Columbia University
Tuesday, October 13, 2015
Outline
1 Recap
2 Shortest paths in graphs with non-negative edge weights
(Dijkstras algorithm)
Graphs with negative edge weights
Algorithms for Data Science
CSOR W4246
Eleni Drinea
Computer Science Department
Columbia University
Tuesday, October 8, 2015
Outline
1 Recap
2 Segmented least squares
An exponential recursive algorithm
3 A Dynamic Programming (DP) solution
A quadratic ite
Algorithms for Data Science
CSOR W4246
Eleni Drinea
Computer Science Department
Columbia University
Thursday, October 1, 2015
Outline
1 Recap
2 Shortest paths in graphs with non-negative edge weights
(Dijkstras algorithm)
Correctness
Implementations
3 Seg
Algorithms for Data Science
CSOR W4246
Eleni Drinea
Computer Science Department
Columbia University
Tuesday, September 22, 2015
Outline
1 Recap
2 Applications of BFS
Connected components in undirected graphs
Testing bipartiteness
3 Depth-rst search (DFS)
Algorithms for Data Science
CSOR W4246
Eleni Drinea
Computer Science Department
Columbia University
Thursday, September 17, 2015
Outline
1 Recap
2 Graphs
3 Representing graphs
4 Breadth-rst search (BFS)
5 Applications of BFS
Connected components in undire
Algorithms for Data Science
CSOR W4246
Eleni Drinea
Computer Science Department
Columbia University
Tuesday, September 15, 2015
Outline
1 Recap
2 The running time of Mergesort and solving recurrences
3 Binary search
4 Integer multiplication
5 Fast matrix
Algorithms for Data Science
CSOR W4246
Eleni Drinea
Computer Science Department
Columbia University
Thursday, September 10, 2015
Outline
1 Asymptotic notation
2 The divide & conquer principle; application: mergesort
3 Solving recurrences and running time