Advanced Topics on Algorithms

Semester:
6ο
Course Type:
Elective Specialization courses (ΠΜ-E)
Track:
CS (Computer Science)
Code:
ΘΠ12
ECTS:
6
TEACHING HOURS per week
Theory:
3
Seminar:
1
Laboratory:
-
Specializations
Foundations of Computer Science (Ε1):
B Βασικό
Data and Knowledge Management (Ε2):
-
Software (Ε3):
-
Hardware and Architecture (Ε4):
-
Communications and Networking (Ε5):
-
Signal and Information Processing (Ε6):
-
Related Courses
Course Content

Approximation Algorithms: Greedy Algorithms, Pricing Method, Linear Programming and Rounding, Polynomial Time Approximation Schemes. Randomized Algorithms: Monte Carlo Algorithms, Las Vegas Algorithms, Randomized Divide and Conquer. Parameterized Algorithms: Bounded Search Trees, Kernelization, Iterative Compression. Online Algorithms: Introductory problems, Marking Algorithms

LITERATURE AND STUDY MATERIALS - READING LIST
  • Kleinberg Jon, Tardos Eva: Σχεδιασμός Αλγορίθμων, Εκδόσεις Κλειδάριθμος 2008
  • Cormen Thomas H., Leiserson Charles E., Rivest Ronald, Stein Clifford: Εισαγωγή στους Αλγορίθμους, Πανεπιστημιακές Εκδόσεις Κρήτης 2016
  • Marek Cygan, Fedor V. Fomin, Łukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk, Saket Saurabh: Parameterized Algorithms, Springer 2015
  • Vijay V. Vazirani: Approximation Algorithms, Springer 2001
  • David P. Williamson, David B. Shmoys: The Design of Approximation Algorithms, Cambridge University Press 2011
  • Michael Mitzenmacher, Eli Upfal: Probability and Computing: Randomized Algorithms and Probabilistic Analysis, Cambridge University Press 2005
  • Rolf Niedermeier: Invitation to Fixed-Parameter Algorithms, Oxford University Press 2006
  • Allan Borodin, Ran El-Yaniv: Online Computation and Competitive Analysis, Cambridge University Press 1998
  • Christos H. Papadimitriou: Computational Complexity, Addison-Wesley 1993