Research Seminar
ta)^2)$. October 19, 2022 Theo Thiery (Queen Mary University of London) A sqrt(3)-approximation for Weighted 3-Dimensional Matching Theo Thiery (Queen Mary University of London) October 19, 2022 at 11:00 [...] whether the problem with equality constraint can also be solved efficiently turned out to be a lot harder. As our main result, we present a strongly polynomial, primal-dual algorithm for the problem with [...] and give a FPTAS in the presence of weights. The multiple machine case turns out to be considerably harder as the unit weight case already is NP-hard for a constant number of machines. Based on the optimal