Combinatorial algorithms 06-DALKLI0
Objective of this course is to acquaint students with a specific and important class of algorithms in the context of combinatorial problems.
The achieved learning outcomes are competences of algorithmic solutions of combinatorial problems which models questions met in practice.
Bibliography
T.Cormen, Ch.Leiserson, R.Rivest, C.Stein, Introduction to algorithms, The Massachusetts Institute of Technology, 2001
S. Dasgupta, Ch. Papadimitriou, U. Vazirani, Algorithms, McGraw-Hill, New York 2008
D. Knuth, Stable marriage and its relation to other combinatorial problems, American Mathematical Society 1997
D. Knuth, The art of computer programming, Volume 4. Generating all tuples and permutations, Addison-Wesley, 2005
D. Kreher, D. Stinson, Combinatorial algorithms, CRC Press 1999
W. Lipski, Kombinatoryka dla programistów, WNT, Warszawa 2004 (in Polish)
E. Reingold, J. Nievergelt, N. Deo, Algorytmy kombinatoryczne, PWN, Warszawa 1985 (in Polish)
P. Stańczyk, Algorytmika praktyczna, Nie tylko dla mistrzów, PWN, Warszawa 2009 (in Polish)
V. Vazirani, Approximation algorithms, Springer-Verlag, 2003
N.Wirth, Algorithms + data structures = programs, Prentice Hall Inc., 1976
Additional information
Additional information (registration calendar, class conductors, localization and schedules of classes), might be available in the USOSweb system: