Universität Wien

390045 UK VGSCO: Selected Topics in Combinatorial Optimization (2018W)

Continuous assessment of course work

Registration/Deregistration

Note: The time of your registration within the registration period has no effect on the allocation of places (no first come, first served).

Details

Language: English

Lecturers

Classes

Block, November 5-16, 2018
Seminar Room 3.307 (3rd floor, Faculty of Business, Economics and Statistics)

Monday 05.11. 10:00 – 12:00
Tuesday 06.11. 11:00 – 13:00
Wednesday 07.11. 10:00 – 12:00
Thursday 08.11. 10:00 – 12:00
Friday 09.11. 10:00 – 12:00
Monday 12.11. 10:00 – 12:00
Tuesday 13.11. 11:00 – 13:00
Wednesday 14.11. 10:00 – 12:00
Thursday 15.11. 10:00 – 12:00
Friday 16.11. 10:00 – 12:00


Information

Aims, contents and method of the course

=============================
Selected Topics in Graph Algorithms
=============================

Graph algorithms are increasingly applied in the context of data analysis tools for systems with a network structure. We focus on modern topics in related optimization problems on graphs. We will discuss recently published graph algorithms, analyse them theoretically, and also consider computational aspects.

The series will include lectures on

- algorithms for certain computational models that are relevant for big data analysis such as data streaming models and parallel computation models,

- classical combinatorial optimization problems such as maximum matching problems, shortest or earliest arrival path problems as well as graph similarity problems and crossing minimization problems,

- combinatorial optimization problems on temporal graphs.

Assessment and permitted materials

Minimum requirements and assessment criteria

Examination topics

Reading list


Association in the course directory

Last modified: We 31.10.2018 15:08