Tentative
schedule for CSCE 52803 - 001 Graph and Combinatorial Algorithms
|
Date |
Topic |
Lecture
Slides |
Recommended
Reading |
|
17-Aug |
Introduction
and preliminaries |
Guichard
Ch.5.1 |
|
|
19-Aug |
|||
|
21-Aug |
|||
|
24-Aug |
Tractable
graph problems |
Guichard
Ch.5.2, Ch.5.4, Ch.5.6 |
|
|
26-Aug |
|||
|
28-Aug |
|||
|
31-Aug |
P and NP
problems |
Vazirani
Ch.1 |
|
|
2-Sep |
|||
|
4-Sep |
|||
|
7-Sep |
Labor Day |
||
|
9-Sep |
Approximation
algorithms |
Vazirani
Ch.2, Ch.15 |
|
|
11-Sep |
|||
|
14-Sep |
|||
|
16-Sep |
|||
|
18-Sep |
|||
|
21-Sep |
|||
|
23-Sep |
Traveling
salesman problem |
||
|
25-Sep |
Machine
learning revisit |
||
|
28-Sep |
Learning-augmented
algorithms |
||
|
30-Sep |
|||
|
2-Oct |
Graph
neural networks |
||
|
5-Oct |
|||
|
7-Oct |
|||
|
9-Oct |
Reinforcement
learning |
||
|
12-Oct |
|||
|
14-Oct |
|||
|
16-Oct |
|||
|
19-Oct |
Fall break |
||
|
21-Oct |
Machine learning
for graph problems |
|
|
|
23-Oct |
|||
|
26-Oct |
Paper
reading and discussion |
||
|
28-Oct |
|||
|
30-Oct |
|||
|
2-Nov |
|||
|
4-Nov |
|||
|
6-Nov |
|||
|
9-Nov |
|||
|
11-Nov |
|||
|
13-Nov |
|||
|
16-Nov |
|||
|
18-Nov |
|||
|
20-Nov |
|||
|
23-Nov |
|||
|
25-Nov |
|||
|
27-Nov |
Thanksgiving |
||
|
30-Nov |
Paper
reading and discussion |
||
|
2-Dec |
Wrap up |
||
|
4-Dec |
Reading
Day |