discipline 
Mathematics, Applied
mathematics

subject 
Approximation
algorithms

lecturers 
Tibor Jordán 
credits 

period 
2 or 4 
curriculum 
approximation algorithms for NPhard
problems, basic techniques, LPrelaxations. Set cover, primaldual
algorithms. Vertex cover, TSP,
Steiner tree, feedback vertex set, bin packing, facility location, scheduling
problems, kcenter, kcut, multicut,
multiway cut, multicommodity
flows, minimum size kconnected subgraphs, minimum
superstring, minimum maxdegree spanning tree 
literature 
V. Vazirani, Approximation algorithms, Springer 2003. 
form of tuition 
Lectures 
mode of assessment 
written/oral
exam 