Toto je starší verze dokumentu!

Integer Programming and Computational Social Choice 23/24

This is essentially another iteration of the Selected Topics from Algorithms course, and this link contains potentially useful resources.

data	what was taught [resources]
26. 2.	Fixed dimension IPs, intro to iterative augmentation. [LN up to Lemma 7]
4. 3.	More details for iterative augmentation. [LN up to Lemma 16]
11. 3.	Norm bound, DP for case of small $m$ and $\\|A\\|_\infty$ [LN Lemma 16, 17]; treedepth, block-structured matrices [LN 3.4]; norm bound for $n$-fold IPs [LN Lemma 29]
18. 3.	Plan: norm bounds and augmentation IP algorithms for $n$-fold and $2$-stage stochastic IPs [LN 3.5.1 and 3.6]

Eventually I will post lecture notes here.