User Tools

Site Tools


teaching:ws2021:aa

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
teaching:ws2021:aa [2020/09/23 13:49]
christine.dahn [Dates]
teaching:ws2021:aa [2020/10/27 14:49] (current)
daniel.schmidt Link to eCampus for Zoom link
Line 1: Line 1:
 ====== Advanced Algorithms ====== ====== Advanced Algorithms ======
  
 +^ Lecturer ​                   | [[people:​mutzel|Prof. Dr. Petra Mutzel]], [[http://​tcs.cs.uni-bonn.de/​doku.php?​id=staff:​dschmidt|Dr. Daniel Schmidt]] |
 ^ Module ​                     | MA-INF 1104                                | ^ Module ​                     | MA-INF 1104                                |
-^ eCampus ​                    ​| ​tba  |+^ eCampus ​                    ​| ​[[https://​ecampus.uni-bonn.de/​goto.php?​target=crs_1883098 ​ | eCampus ​ ]] |
 ^ BASIS                       | [[https://​basis.uni-bonn.de/​qisserver/​rds?​state=verpublish&​status=init&​vmfile=no&​publishid=184451&​moduleCall=webInfo&​publishConfFile=webInfo&​publishSubDir=veranstaltung|612111104 ​  ]] | ^ BASIS                       | [[https://​basis.uni-bonn.de/​qisserver/​rds?​state=verpublish&​status=init&​vmfile=no&​publishid=184451&​moduleCall=webInfo&​publishConfFile=webInfo&​publishSubDir=veranstaltung|612111104 ​  ]] |
  
 +==== Topics =====
 +
 +We will explore advanced techniques for the design and the analysis of algorithms with selected examples from classical as well as modern algorithmics. ​
 +Our discussion will include both polynomial time and exponential time exact algorithms, as well as approximation algorithms for combinatorial optimization problems (often on graphs) and their analysis.
 +
 +We will discuss techniques such as amortized analysis, duality of linear programs, integer linear programming,​ and techniques for big data (e.g. parallel algorithms, streaming algorithms).
 +Topics will include algorithms for (time-dependent) network flows, min-cost flows, streaming for bipartite matching, parallel shortest paths, traveling salesman problem, linear ordering, and data structures such as, e.g., Fibonacci heaps, Union-Find, (Cuckoo) Hashing, and their analysis.
  
 ==== Dates ==== ==== Dates ====
  
 ^ Subject ​              ^ When            ^ Where     ^ Start      ^ Lecturer ^ ^ Subject ​              ^ When            ^ Where     ^ Start      ^ Lecturer ^
-| Lectures ​             | Tuesday 12-14  and Thursday 10-12  | Online via Zoom  | 27.10.2020 | [[people:​mutzel|Prof. Dr. Petra Mutzel]], [[http://​tcs.cs.uni-bonn.de/​doku.php?​id=staff:​dschmidt | Dr. Daniel Schmidt]] | +| Lectures ​             | Tuesday 12-14  and Thursday 10-12  | Online via Zoom  | 03.11.2020 | [[people:​mutzel|Prof. Dr. Petra Mutzel]], [[http://​tcs.cs.uni-bonn.de/​doku.php?​id=staff:​dschmidt | Dr. Daniel Schmidt]] | 
-| Tutorial 1            | Tuesday 14-16   | Online via BBB  | 03.11.2020 | [[people:​dahn| Dahn]], [[https://​ca.cs.uni-bonn.de/​doku.php?​id=oettershagen| Oettershagen]] | + 
-| Tutorial 2            | Thursday **12-14** | Online via BBB  | 05.11.2020 | [[people:​dahn| Dahn]], [[https://​ca.cs.uni-bonn.de/​doku.php?​id=oettershagen| Oettershagen]] |+Please see [[https://​ecampus.uni-bonn.de/​goto_ecampus_crs_1883098.html|eCampus for the Zoom link to the lecture]]. 
 +==== Tutorials ==== 
 + 
 +The lectures are accompanied by tutorials. There are two alternative appointments. You only need to attend one of the appointments. The assignment of the attendees is done via [[https://​tvs.cs.uni-bonn.de|TVS]].  
 +Registering is possible until 05.11. 
 + 
 +^ Subject ​              ^ When            ^ Where     ^ Start      ^ Lecturer ^ 
 +| Tutorial 1            | Tuesday 14-16   | Online via BBB  | 10.11.2020 | [[people:​dahn| Dahn]], [[https://​ca.cs.uni-bonn.de/​doku.php?​id=oettershagen| Oettershagen]] | 
 +| Tutorial 2            | Thursday **12-14** | Online via BBB  | 12.11.2020 | [[people:​dahn| Dahn]], [[https://​ca.cs.uni-bonn.de/​doku.php?​id=oettershagen| Oettershagen]] | 
 + 
 +==== Exam ==== 
 + 
 +There will be a **written** exam in the usual exam period. ​
  
teaching/ws2021/aa.1600861790.txt.gz · Last modified: 2020/09/23 13:49 by christine.dahn

Page Tools