teaching:ipcomsoc2324
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. | Plan: norm bound, DP for case of small $m$ and $\|A\|_\infty$ [LN Lemma 16, 17]; read [LN 3.4] without proofs. |
Resources:
- [LN]: Lecture notes from last year
Eventually I will post lecture notes here.
teaching/ipcomsoc2324.1709765046.txt.gz · Poslední úprava: 2024/03/06 23:44 autor: Martin Koutecky