Combinatorial algorithms

Course Description

Combinatorial structures. Combinatorial algorithm design techniques. Analysis of combinatorial algorithms. Generating elementary combinatorial objects (subsets, Gray codes, permutations, set partitions). Backtracking algorithms. The knapsack problem. The traveling salesman problem. The maximum clique problem in graphs. Heuristic search (hill-climbing strategy, simulated annealing, tabu search, genetic algorithms).

Study Programmes

Postgraduate doctoral study programme

Literature

Donald L. Kreher, Douglas R. Stinson (1998.), Combinatorial Algorithms, CRC Press
Dieter Jungnickel (2013.), Graphs, Networks and Algorithms, Springer Science & Business Media
Darko Veljan (2001.), Kombinatorna i diskretna matematika, Algoritam, Zagreb

For students

General

ID 154906
  Winter semester
6 ECTS
L0 English Level