Abstract
During his stay of 2 weeks, prof. Vallentin will collaborate with the host on at least two research problems: finding better upper bounds for the densities of distance-avoiding sets and finding better approximation algorithms for the maximum-cut problem. Prof. Vallentin will have the opportunity to present a seminar to the local Combinatorics and Optimization group, he will be able to int…