Tentative schedule for CSCE 52803 - 001 Graph and Combinatorial Algorithms

Date	Topic	Lecture Slides	Recommended Reading
17-Aug	Introduction and preliminaries	0-intro 1-graph-basics	Guichard Ch.5.1
19-Aug
21-Aug
24-Aug	Tractable graph problems	2-graph-theory	Guichard Ch.5.2, Ch.5.4, Ch.5.6
26-Aug
28-Aug
31-Aug	P and NP problems	3-np	Vazirani Ch.1
2-Sep
4-Sep
7-Sep	Labor Day
9-Sep	Approximation algorithms	4-appro-alg-1 4-appro-alg-2	Vazirani Ch.2, Ch.15
11-Sep
14-Sep
16-Sep
18-Sep
21-Sep
23-Sep	Traveling salesman problem	5-tsp
25-Sep
28-Sep	Machine learning revisit	6-ml-basics 7-nn	Zhang Ch.1, Ch.2, Ch.3, Ch.4
30-Sep	Learning-augmented algorithms	8-learning-augmented-1 9-learning-augmented-2
2-Oct
5-Oct	Graph neural networks	10-gnn	Wu Ch.2, Ch.3
7-Oct
9-Oct
12-Oct	Reinforcement learning	11-rl 12-rl2
14-Oct
16-Oct
19-Oct	Fall break
21-Oct	Machine learning for graph problems	13-ptr-net
23-Oct		14-s2v-dqn
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
4-Dec	Wrap up