Seminar: Algorithm Design – Dijkstra, Fibonacci & Co

Topics

  • Divide & Conquer (Recursion + Dynamic Programming)
  • Randomized Algorithms
  • Approximation Algorithms
  • Online Algorithms
  • Sorting in Linear Time
  • Search Trees
  • Fibonacci Heaps
  • Hashing
  • Amortized Analysis

Prerequisites

Necessary: Algorithmic Discrete Mathematics (MA2501)

Literature

  • Introduction to Algorithms, T. H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein
  • Probability and Computing, M. Mitzenmacher and E. Upfal
  • The design of Approximation Algorithms, D.P. Williamson and D. B. Shmoys
  • Online Computation and Competitive Analysis, A. Borodin and R. El-Yaniv

The materials and presentations made available to you for educational purposes are copyrighted work. We ask you to observe the applicable copyright law. You may only use these copyrighted materials for the purposes of your studies. Any further use requires the explicit prior consent of the copyright holder. In particular, it is not permitted to record (recording on your own computer of either synchronous or asynchronous teaching units), share them with third parties, reproduce them publicly or use them for commercial purposes.