Credit points: 2.0
The seminar deals with two rounding approaches in approximation algorithms: rounding of semi-definite programs and iterative rounding. Examples of topics that will be covered: correlation clustering, coloring, maximizing quadratic forms, Grothendick's inequality, bounded degree spanning trees, and networks design.
The seminar deals with two rounding approaches in approximation algorithms: rounding of semi-definite programs and iterative rounding. Examples of topics that will be covered: correlation clustering, coloring, maximizing quadratic forms, Grothendick's inequality, bounded degree spanning trees, and networks design.